./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/string-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:57:06,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:57:06,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:57:06,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:57:06,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:57:06,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:57:06,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:57:06,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:57:06,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:57:06,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:57:06,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:57:06,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:57:06,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:57:06,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:57:06,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:57:06,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:57:06,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:57:06,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:57:06,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:57:06,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:57:06,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:57:06,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:57:06,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:57:06,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:57:06,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:57:06,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:57:06,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:57:06,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:57:06,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:57:06,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:57:06,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:57:06,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:57:06,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:57:06,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:57:06,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:57:06,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:57:06,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:57:06,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:57:06,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:57:06,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:57:06,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:57:06,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:57:06,127 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:57:06,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:57:06,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:57:06,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:57:06,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:57:06,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:57:06,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:57:06,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:57:06,135 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:57:06,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:57:06,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:57:06,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:57:06,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:57:06,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:57:06,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:57:06,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:57:06,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:57:06,139 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:57:06,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:57:06,139 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:57:06,139 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2023-02-15 10:57:06,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:57:06,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:57:06,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:57:06,347 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:57:06,347 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:57:06,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2023-02-15 10:57:07,291 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:57:07,447 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:57:07,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2023-02-15 10:57:07,454 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e33cb51/ec15fc8ee6654f88831e62856a03d81a/FLAGde936ab56 [2023-02-15 10:57:07,462 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e33cb51/ec15fc8ee6654f88831e62856a03d81a [2023-02-15 10:57:07,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:57:07,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:57:07,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:57:07,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:57:07,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:57:07,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ece9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07, skipping insertion in model container [2023-02-15 10:57:07,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:57:07,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:57:07,587 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/string-2.i[896,909] [2023-02-15 10:57:07,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:57:07,609 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:57:07,617 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/string-2.i[896,909] [2023-02-15 10:57:07,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:57:07,631 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:57:07,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07 WrapperNode [2023-02-15 10:57:07,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:57:07,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:57:07,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:57:07,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:57:07,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,653 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2023-02-15 10:57:07,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:57:07,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:57:07,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:57:07,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:57:07,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:57:07,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:57:07,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:57:07,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:57:07,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (1/1) ... [2023-02-15 10:57:07,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:57:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:57:07,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:57:07,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:57:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:57:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:57:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:57:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:57:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:57:07,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:57:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:57:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:57:07,783 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:57:07,784 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:57:07,973 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:57:07,976 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:57:07,977 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 10:57:07,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:07 BoogieIcfgContainer [2023-02-15 10:57:07,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:57:07,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:57:07,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:57:07,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:57:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:57:07" (1/3) ... [2023-02-15 10:57:08,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d7b70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:08, skipping insertion in model container [2023-02-15 10:57:08,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:07" (2/3) ... [2023-02-15 10:57:08,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d7b70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:08, skipping insertion in model container [2023-02-15 10:57:08,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:07" (3/3) ... [2023-02-15 10:57:08,007 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2023-02-15 10:57:08,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:57:08,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:57:08,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:57:08,060 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;@6cfe68e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:57:08,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:57:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:57:08,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:08,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:08,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2023-02-15 10:57:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:57:08,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767210351] [2023-02-15 10:57:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:57:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:57:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:57:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767210351] [2023-02-15 10:57:08,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767210351] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:08,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:08,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:57:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005872062] [2023-02-15 10:57:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:08,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:57:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:57:08,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:57:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:57:08,300 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:08,356 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2023-02-15 10:57:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:57:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-02-15 10:57:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:08,363 INFO L225 Difference]: With dead ends: 62 [2023-02-15 10:57:08,365 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:57:08,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:57:08,373 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:08,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:57:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-02-15 10:57:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-15 10:57:08,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2023-02-15 10:57:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:08,403 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-15 10:57:08,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-15 10:57:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:57:08,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:08,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:08,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:57:08,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2023-02-15 10:57:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:57:08,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104464] [2023-02-15 10:57:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:57:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:57:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:57:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104464] [2023-02-15 10:57:08,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104464] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:57:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444582859] [2023-02-15 10:57:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:08,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:57:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:57:08,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:57:08,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:57:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:08,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:57:08,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:57:08,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:57:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:57:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444582859] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:57:08,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:57:08,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 10:57:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491860294] [2023-02-15 10:57:08,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:57:08,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:57:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:57:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:57:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:57:08,677 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:08,738 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2023-02-15 10:57:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:57:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 22 [2023-02-15 10:57:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:08,739 INFO L225 Difference]: With dead ends: 79 [2023-02-15 10:57:08,739 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:57:08,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:57:08,740 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:08,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 59 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:57:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2023-02-15 10:57:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-02-15 10:57:08,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2023-02-15 10:57:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-02-15 10:57:08,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-02-15 10:57:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:57:08,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:08,746 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:08,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:57:08,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:57:08,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2023-02-15 10:57:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:57:08,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093608380] [2023-02-15 10:57:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:57:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 10:57:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:57:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093608380] [2023-02-15 10:57:09,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093608380] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:57:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663909776] [2023-02-15 10:57:09,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:57:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:57:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:57:09,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:57:09,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:57:09,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:57:09,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:57:09,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:57:09,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 10:57:09,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:57:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 10:57:09,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663909776] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:57:09,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:57:09,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-02-15 10:57:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754464461] [2023-02-15 10:57:09,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:57:09,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 10:57:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:57:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 10:57:09,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:57:09,205 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:09,256 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2023-02-15 10:57:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:57:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 10:57:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:09,257 INFO L225 Difference]: With dead ends: 95 [2023-02-15 10:57:09,257 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 10:57:09,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:57:09,258 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:09,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 59 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 10:57:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2023-02-15 10:57:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-02-15 10:57:09,262 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2023-02-15 10:57:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:09,263 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-02-15 10:57:09,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-02-15 10:57:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 10:57:09,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:09,264 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:09,268 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-15 10:57:09,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-15 10:57:09,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 3 times [2023-02-15 10:57:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:57:09,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803874829] [2023-02-15 10:57:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:57:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:57:09,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:57:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:57:09,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 10:57:09,547 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:57:09,548 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:57:09,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:57:09,551 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-02-15 10:57:09,553 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:57:09,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:57:09 BoogieIcfgContainer [2023-02-15 10:57:09,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:57:09,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:57:09,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:57:09,581 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:57:09,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:07" (3/4) ... [2023-02-15 10:57:09,583 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 10:57:09,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:57:09,583 INFO L158 Benchmark]: Toolchain (without parser) took 2118.68ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 96.7MB in the beginning and 115.8MB in the end (delta: -19.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-02-15 10:57:09,583 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 98.8MB in the beginning and 98.7MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:57:09,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.01ms. Allocated memory is still 130.0MB. Free memory was 96.4MB in the beginning and 85.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 10:57:09,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.67ms. Allocated memory is still 130.0MB. Free memory was 85.7MB in the beginning and 83.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:57:09,584 INFO L158 Benchmark]: Boogie Preprocessor took 16.35ms. Allocated memory is still 130.0MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:57:09,584 INFO L158 Benchmark]: RCFGBuilder took 307.52ms. Allocated memory is still 130.0MB. Free memory was 82.3MB in the beginning and 70.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 10:57:09,585 INFO L158 Benchmark]: TraceAbstraction took 1584.74ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 69.7MB in the beginning and 116.8MB in the end (delta: -47.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:57:09,585 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 163.6MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:57:09,586 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.15ms. Allocated memory is still 130.0MB. Free memory was 98.8MB in the beginning and 98.7MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.01ms. Allocated memory is still 130.0MB. Free memory was 96.4MB in the beginning and 85.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.67ms. Allocated memory is still 130.0MB. Free memory was 85.7MB in the beginning and 83.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.35ms. Allocated memory is still 130.0MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.52ms. Allocated memory is still 130.0MB. Free memory was 82.3MB in the beginning and 70.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1584.74ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 69.7MB in the beginning and 116.8MB in the end (delta: -47.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 163.6MB. Free memory is still 115.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={6:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={6:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L55] COND FALSE !((inc_B-1)< 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2023-02-15 10:57:11,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:57:11,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:57:11,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:57:11,621 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:57:11,622 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:57:11,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2023-02-15 10:57:12,550 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:57:12,652 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:57:12,653 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2023-02-15 10:57:12,656 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133d2fcb3/cb0a34471b634a0e8379c536f25936ff/FLAG42fb11cd7 [2023-02-15 10:57:12,665 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133d2fcb3/cb0a34471b634a0e8379c536f25936ff [2023-02-15 10:57:12,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:57:12,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:57:12,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:57:12,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:57:12,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:57:12,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aeffa63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12, skipping insertion in model container [2023-02-15 10:57:12,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:57:12,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:57:12,804 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/string-2.i[896,909] [2023-02-15 10:57:12,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:57:12,850 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:57:12,860 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/string-2.i[896,909] [2023-02-15 10:57:12,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:57:12,897 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:57:12,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12 WrapperNode [2023-02-15 10:57:12,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:57:12,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:57:12,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:57:12,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:57:12,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,937 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2023-02-15 10:57:12,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:57:12,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:57:12,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:57:12,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:57:12,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:57:12,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:57:12,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:57:12,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:57:12,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (1/1) ... [2023-02-15 10:57:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:57:12,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:57:13,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:57:13,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:57:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:57:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 10:57:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 10:57:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:57:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:57:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:57:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 10:57:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:57:13,078 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:57:13,079 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:57:13,229 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:57:13,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:57:13,234 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 10:57:13,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:13 BoogieIcfgContainer [2023-02-15 10:57:13,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:57:13,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:57:13,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:57:13,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:57:13,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:57:12" (1/3) ... [2023-02-15 10:57:13,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5727a709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:13, skipping insertion in model container [2023-02-15 10:57:13,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:57:12" (2/3) ... [2023-02-15 10:57:13,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5727a709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:13, skipping insertion in model container [2023-02-15 10:57:13,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:13" (3/3) ... [2023-02-15 10:57:13,240 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2023-02-15 10:57:13,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:57:13,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:57:13,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:57:13,300 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;@6f0fa373, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:57:13,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:57:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:57:13,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:13,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:13,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2023-02-15 10:57:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:13,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136716745] [2023-02-15 10:57:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:13,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:13,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:13,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 10:57:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:13,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:57:13,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:57:13,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:57:13,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:13,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136716745] [2023-02-15 10:57:13,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136716745] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:13,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:13,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:57:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031905537] [2023-02-15 10:57:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:13,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:57:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:57:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:57:13,466 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:13,482 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2023-02-15 10:57:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:57:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2023-02-15 10:57:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:13,489 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:57:13,489 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 10:57:13,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-15 10:57:13,494 INFO L413 NwaCegarLoop]: 34 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, 34 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-15 10:57:13,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 10:57:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 10:57:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-15 10:57:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-02-15 10:57:13,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2023-02-15 10:57:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:13,519 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-15 10:57:13,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-02-15 10:57:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:57:13,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:13,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:13,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:13,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:13,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2023-02-15 10:57:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:13,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070871797] [2023-02-15 10:57:13,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:13,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:13,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 10:57:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:13,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 10:57:13,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:57:13,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:57:13,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070871797] [2023-02-15 10:57:13,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070871797] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:13,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:13,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:57:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274495186] [2023-02-15 10:57:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:13,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:57:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:57:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:57:13,825 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-15 10:57:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:13,864 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-02-15 10:57:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:57:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Word has length 18 [2023-02-15 10:57:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:13,870 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:57:13,870 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:57:13,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:57:13,871 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:13,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:57:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-02-15 10:57:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-15 10:57:13,875 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2023-02-15 10:57:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:13,876 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-15 10:57:13,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-15 10:57:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-15 10:57:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:57:13,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:13,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:13,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:14,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2023-02-15 10:57:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:14,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503766685] [2023-02-15 10:57:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:14,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:14,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:14,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 10:57:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:14,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:57:14,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:57:14,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:57:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:57:14,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:14,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503766685] [2023-02-15 10:57:14,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503766685] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:57:14,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:57:14,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-15 10:57:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654536888] [2023-02-15 10:57:14,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:57:14,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:57:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:57:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:57:14,201 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:14,312 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2023-02-15 10:57:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:57:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 10:57:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:14,313 INFO L225 Difference]: With dead ends: 79 [2023-02-15 10:57:14,313 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:57:14,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:57:14,314 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:14,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 63 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:57:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:57:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2023-02-15 10:57:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-02-15 10:57:14,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2023-02-15 10:57:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:14,320 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-02-15 10:57:14,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-02-15 10:57:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:57:14,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:14,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:14,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:14,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2023-02-15 10:57:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:14,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327275314] [2023-02-15 10:57:14,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:57:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:14,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:14,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 10:57:14,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 10:57:14,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:57:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 10:57:14,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-15 10:57:14,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:57:14,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:14,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327275314] [2023-02-15 10:57:14,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327275314] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:14,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:14,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:57:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575431387] [2023-02-15 10:57:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:57:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:57:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:57:14,611 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-15 10:57:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:14,643 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-15 10:57:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:57:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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) Word has length 34 [2023-02-15 10:57:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:14,644 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:57:14,644 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:57:14,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:57:14,645 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 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-15 10:57:14,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:57:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 10:57:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 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-15 10:57:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-15 10:57:14,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2023-02-15 10:57:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:14,649 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-15 10:57:14,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-15 10:57:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-15 10:57:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:57:14,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:14,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:14,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:14,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2023-02-15 10:57:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:14,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322084000] [2023-02-15 10:57:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:14,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:14,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 10:57:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:14,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:57:14,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:57:14,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:57:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:57:15,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:15,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322084000] [2023-02-15 10:57:15,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322084000] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:57:15,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:57:15,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 10:57:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100280517] [2023-02-15 10:57:15,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:57:15,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:57:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:57:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:57:15,055 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:15,305 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2023-02-15 10:57:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:57:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 10:57:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:15,306 INFO L225 Difference]: With dead ends: 101 [2023-02-15 10:57:15,306 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 10:57:15,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:57:15,308 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 98 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:15,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 133 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:57:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 10:57:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2023-02-15 10:57:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-02-15 10:57:15,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2023-02-15 10:57:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:15,314 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-02-15 10:57:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-02-15 10:57:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:57:15,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:15,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:15,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:15,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:15,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2023-02-15 10:57:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:15,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199014158] [2023-02-15 10:57:15,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:57:15,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:15,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:15,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 10:57:15,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 10:57:15,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:57:15,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:57:15,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-15 10:57:15,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:57:15,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199014158] [2023-02-15 10:57:15,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199014158] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:15,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:15,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:57:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060462933] [2023-02-15 10:57:15,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:15,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:57:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:57:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:57:15,614 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:15,655 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-02-15 10:57:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:57:15,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 10:57:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:15,656 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:57:15,656 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 10:57:15,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:57:15,657 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:15,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 10:57:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-02-15 10:57:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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-15 10:57:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-02-15 10:57:15,660 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2023-02-15 10:57:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:15,660 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-02-15 10:57:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-02-15 10:57:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:57:15,661 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:15,661 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:15,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-15 10:57:15,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:15,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2023-02-15 10:57:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:15,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817867810] [2023-02-15 10:57:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:15,870 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:15,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 10:57:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:57:15,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:57:15,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:57:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-15 10:57:15,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:57:15,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:57:15,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817867810] [2023-02-15 10:57:15,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817867810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:57:15,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:57:15,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:57:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720888312] [2023-02-15 10:57:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:57:15,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:57:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:57:15,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:57:15,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:57:15,960 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:57:15,980 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-02-15 10:57:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:57:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 10:57:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:57:15,981 INFO L225 Difference]: With dead ends: 58 [2023-02-15 10:57:15,981 INFO L226 Difference]: Without dead ends: 45 [2023-02-15 10:57:15,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-15 10:57:15,982 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:57:15,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:57:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-15 10:57:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-15 10:57:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-02-15 10:57:15,985 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2023-02-15 10:57:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:57:15,989 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-02-15 10:57:15,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:57:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-02-15 10:57:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:57:15,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:57:15,994 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:57:16,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:57:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:16,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:57:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:57:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2023-02-15 10:57:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:57:16,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239226464] [2023-02-15 10:57:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:57:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:16,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:57:16,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:57:16,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 10:57:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:57:16,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:57:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:57:16,386 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 10:57:16,387 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:57:16,387 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:57:16,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-15 10:57:16,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:57:16,592 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-02-15 10:57:16,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:57:16,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:57:16 BoogieIcfgContainer [2023-02-15 10:57:16,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:57:16,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:57:16,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:57:16,619 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:57:16,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:13" (3/4) ... [2023-02-15 10:57:16,621 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 10:57:16,667 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:57:16,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:57:16,669 INFO L158 Benchmark]: Toolchain (without parser) took 4001.65ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 33.3MB in the beginning and 38.1MB in the end (delta: -4.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,670 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:57:16,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.69ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 37.7MB in the end (delta: -4.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.82ms. Allocated memory is still 62.9MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,670 INFO L158 Benchmark]: Boogie Preprocessor took 40.14ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 34.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,671 INFO L158 Benchmark]: RCFGBuilder took 255.06ms. Allocated memory is still 62.9MB. Free memory was 34.2MB in the beginning and 35.6MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,671 INFO L158 Benchmark]: TraceAbstraction took 3383.05ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 41.8MB in the end (delta: -6.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,671 INFO L158 Benchmark]: Witness Printer took 49.89ms. Allocated memory is still 77.6MB. Free memory was 41.8MB in the beginning and 38.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:57:16,672 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.15ms. Allocated memory is still 48.2MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.69ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 37.7MB in the end (delta: -4.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.82ms. Allocated memory is still 62.9MB. Free memory was 37.5MB in the beginning and 35.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.14ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 34.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 255.06ms. Allocated memory is still 62.9MB. Free memory was 34.2MB in the beginning and 35.6MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3383.05ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 41.8MB in the end (delta: -6.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 49.89ms. Allocated memory is still 77.6MB. Free memory was 41.8MB in the beginning and 38.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={3:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={3:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_A[nc_A]=-128, string_B={7:0}] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={7:0}, string_B[nc_B]=-128] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}] [L55] COND TRUE (inc_B-1)<