./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 b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/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-?-b5317da-m [2023-02-16 01:17:40,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:17:40,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:17:40,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:17:40,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:17:40,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:17:40,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:17:40,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:17:40,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:17:40,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:17:40,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:17:40,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:17:40,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:17:40,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:17:40,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:17:40,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:17:40,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:17:40,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:17:40,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:17:40,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:17:40,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:17:40,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:17:40,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:17:40,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:17:40,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:17:40,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:17:40,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:17:40,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:17:40,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:17:40,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:17:40,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:17:40,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:17:40,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:17:40,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:17:40,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:17:40,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:17:40,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:17:40,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:17:40,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:17:40,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:17:40,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:17:40,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:17:40,583 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:17:40,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:17:40,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:17:40,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:17:40,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:17:40,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:17:40,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:17:40,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:17:40,586 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:17:40,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:17:40,587 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:17:40,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:17:40,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:17:40,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:17:40,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:17:40,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:17:40,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:17:40,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:17:40,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:17:40,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:17:40,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:17:40,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:17:40,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:17:40,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:17:40,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:17:40,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:17:40,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:17:40,591 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:17:40,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:17:40,591 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:17:40,591 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-16 01:17:40,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:17:40,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:17:40,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:17:40,815 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:17:40,815 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:17:40,816 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-16 01:17:41,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:17:41,923 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:17:41,924 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2023-02-16 01:17:41,928 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb668da59/4b0c053b861d4bdc93ddb68c2392fde3/FLAGa16cf46fb [2023-02-16 01:17:41,954 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb668da59/4b0c053b861d4bdc93ddb68c2392fde3 [2023-02-16 01:17:41,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:17:41,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:17:41,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:17:41,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:17:41,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:17:41,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:17:41" (1/1) ... [2023-02-16 01:17:41,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b024b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:41, skipping insertion in model container [2023-02-16 01:17:41,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:17:41" (1/1) ... [2023-02-16 01:17:41,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:17:41,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:17:42,092 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-16 01:17:42,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:17:42,119 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:17:42,127 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-16 01:17:42,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:17:42,142 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:17:42,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42 WrapperNode [2023-02-16 01:17:42,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:17:42,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:17:42,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:17:42,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:17:42,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,166 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2023-02-16 01:17:42,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:17:42,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:17:42,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:17:42,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:17:42,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:17:42,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:17:42,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:17:42,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:17:42,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (1/1) ... [2023-02-16 01:17:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:17:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:17:42,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 01:17:42,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:17:42,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:17:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:17:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:17:42,282 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:17:42,284 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:17:42,465 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:17:42,469 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:17:42,471 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 01:17:42,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:42 BoogieIcfgContainer [2023-02-16 01:17:42,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:17:42,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:17:42,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:17:42,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:17:42,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:17:41" (1/3) ... [2023-02-16 01:17:42,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e62948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:17:42, skipping insertion in model container [2023-02-16 01:17:42,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:42" (2/3) ... [2023-02-16 01:17:42,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e62948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:17:42, skipping insertion in model container [2023-02-16 01:17:42,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:42" (3/3) ... [2023-02-16 01:17:42,492 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2023-02-16 01:17:42,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:17:42,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:17:42,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:17:42,553 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;@75e67e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:17:42,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:17:42,556 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-16 01:17:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 01:17:42,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:42,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:17:42,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2023-02-16 01:17:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:17:42,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754134790] [2023-02-16 01:17:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:17:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:17:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:17:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754134790] [2023-02-16 01:17:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754134790] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:42,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:17:42,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729762333] [2023-02-16 01:17:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:42,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:17:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:17:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:17:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:17:42,735 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-16 01:17:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:42,803 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2023-02-16 01:17:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:17:42,805 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-16 01:17:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:42,811 INFO L225 Difference]: With dead ends: 62 [2023-02-16 01:17:42,811 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 01:17:42,814 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-16 01:17:42,819 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-16 01:17:42,820 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-16 01:17:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 01:17:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-02-16 01:17:42,845 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-16 01:17:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-16 01:17:42,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2023-02-16 01:17:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:42,848 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-16 01:17:42,848 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-16 01:17:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-16 01:17:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 01:17:42,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:42,849 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-16 01:17:42,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:17:42,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2023-02-16 01:17:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:17:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675494369] [2023-02-16 01:17:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:17:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:42,949 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-16 01:17:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:17:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675494369] [2023-02-16 01:17:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675494369] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:17:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001626513] [2023-02-16 01:17:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:17:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:17:42,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:17:42,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 01:17:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:43,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 01:17:43,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:43,052 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-16 01:17:43,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:17:43,082 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-16 01:17:43,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001626513] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:17:43,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:17:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-16 01:17:43,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166797355] [2023-02-16 01:17:43,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:17:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 01:17:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:17:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 01:17:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 01:17:43,085 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-16 01:17:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:43,137 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2023-02-16 01:17:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 01:17:43,138 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-16 01:17:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:43,139 INFO L225 Difference]: With dead ends: 79 [2023-02-16 01:17:43,139 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 01:17:43,139 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-16 01:17:43,140 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-16 01:17:43,141 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-16 01:17:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 01:17:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2023-02-16 01:17:43,153 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-16 01:17:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-02-16 01:17:43,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2023-02-16 01:17:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:43,155 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-02-16 01:17:43,155 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-16 01:17:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-02-16 01:17:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 01:17:43,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:43,157 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-16 01:17:43,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:17:43,362 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-16 01:17:43,362 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2023-02-16 01:17:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:17:43,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753979546] [2023-02-16 01:17:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:17:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:43,479 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-16 01:17:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:17:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753979546] [2023-02-16 01:17:43,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753979546] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:17:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569587888] [2023-02-16 01:17:43,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:17:43,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:17:43,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:17:43,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:17:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 01:17:43,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:17:43,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:17:43,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:17:43,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:43,583 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-16 01:17:43,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:17:43,613 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-16 01:17:43,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569587888] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:17:43,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:17:43,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-02-16 01:17:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121346969] [2023-02-16 01:17:43,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:17:43,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 01:17:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:17:43,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 01:17:43,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-16 01:17:43,615 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-16 01:17:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:43,692 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2023-02-16 01:17:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 01:17:43,693 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-16 01:17:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:43,694 INFO L225 Difference]: With dead ends: 95 [2023-02-16 01:17:43,694 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 01:17:43,695 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-16 01:17:43,697 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:17:43,698 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.1s Time] [2023-02-16 01:17:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 01:17:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2023-02-16 01:17:43,704 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-16 01:17:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-02-16 01:17:43,704 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2023-02-16 01:17:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:43,705 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-02-16 01:17:43,705 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-16 01:17:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-02-16 01:17:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:17:43,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:43,706 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-16 01:17:43,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 01:17:43,911 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-16 01:17:43,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 3 times [2023-02-16 01:17:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:17:43,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104060820] [2023-02-16 01:17:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:17:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:17:43,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 01:17:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:17:44,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 01:17:44,005 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 01:17:44,005 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 01:17:44,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 01:17:44,011 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-02-16 01:17:44,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 01:17:44,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 01:17:44 BoogieIcfgContainer [2023-02-16 01:17:44,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 01:17:44,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 01:17:44,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 01:17:44,055 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 01:17:44,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:42" (3/4) ... [2023-02-16 01:17:44,058 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 01:17:44,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 01:17:44,060 INFO L158 Benchmark]: Toolchain (without parser) took 2101.83ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 81.8MB in the end (delta: 48.2MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,060 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.06ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 119.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.08ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,061 INFO L158 Benchmark]: Boogie Preprocessor took 18.30ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 116.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:17:44,062 INFO L158 Benchmark]: RCFGBuilder took 299.96ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 103.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,062 INFO L158 Benchmark]: TraceAbstraction took 1567.42ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-02-16 01:17:44,062 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 167.8MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:17:44,065 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.16ms. Allocated memory is still 138.4MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.06ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 119.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.08ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.30ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 116.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.96ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 103.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1567.42ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 167.8MB. Free memory is still 81.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-16 01:17:46,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:17:46,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:17:46,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:17:46,344 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:17:46,345 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:17:46,346 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-16 01:17:47,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:17:47,519 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:17:47,520 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2023-02-16 01:17:47,524 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b8ecc71/30b81fc6b42b443fb37f02eed8d27142/FLAG92d7a61a9 [2023-02-16 01:17:47,535 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b8ecc71/30b81fc6b42b443fb37f02eed8d27142 [2023-02-16 01:17:47,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:17:47,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:17:47,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:17:47,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:17:47,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:17:47,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194f410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47, skipping insertion in model container [2023-02-16 01:17:47,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:17:47,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:17:47,643 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-16 01:17:47,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:17:47,661 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:17:47,669 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-16 01:17:47,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:17:47,683 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:17:47,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47 WrapperNode [2023-02-16 01:17:47,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:17:47,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:17:47,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:17:47,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:17:47,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,706 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2023-02-16 01:17:47,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:17:47,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:17:47,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:17:47,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:17:47,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,723 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:17:47,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:17:47,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:17:47,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:17:47,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (1/1) ... [2023-02-16 01:17:47,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:17:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:17:47,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 01:17:47,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 01:17:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:17:47,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-16 01:17:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:17:47,829 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:17:47,831 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:17:47,986 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:17:47,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:17:47,991 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 01:17:47,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:47 BoogieIcfgContainer [2023-02-16 01:17:47,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:17:47,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:17:47,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:17:47,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:17:47,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:17:47" (1/3) ... [2023-02-16 01:17:47,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a61d0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:17:47, skipping insertion in model container [2023-02-16 01:17:47,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:17:47" (2/3) ... [2023-02-16 01:17:47,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a61d0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:17:47, skipping insertion in model container [2023-02-16 01:17:47,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:47" (3/3) ... [2023-02-16 01:17:47,999 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2023-02-16 01:17:48,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:17:48,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:17:48,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:17:48,067 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;@4897f89, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:17:48,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:17:48,070 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-16 01:17:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 01:17:48,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:48,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:17:48,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2023-02-16 01:17:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:48,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668568961] [2023-02-16 01:17:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:48,088 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-16 01:17:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:48,091 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-16 01:17:48,135 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-16 01:17:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:48,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 01:17:48,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:17:48,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:17:48,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:48,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668568961] [2023-02-16 01:17:48,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668568961] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:48,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:48,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:17:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429638854] [2023-02-16 01:17:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:17:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:17:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:17:48,233 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-16 01:17:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:48,244 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2023-02-16 01:17:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:17:48,245 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-16 01:17:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:48,250 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:17:48,250 INFO L226 Difference]: Without dead ends: 22 [2023-02-16 01:17:48,251 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-16 01:17:48,253 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-16 01:17:48,254 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-16 01:17:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-16 01:17:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-16 01:17:48,271 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-16 01:17:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-02-16 01:17:48,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2023-02-16 01:17:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:48,273 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-16 01:17:48,273 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-16 01:17:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-02-16 01:17:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 01:17:48,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:48,274 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-16 01:17:48,286 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-16 01:17:48,480 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-16 01:17:48,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2023-02-16 01:17:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115523286] [2023-02-16 01:17:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:48,482 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-16 01:17:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:48,484 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-16 01:17:48,486 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-16 01:17:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:48,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 01:17:48,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:17:48,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:17:48,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:48,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115523286] [2023-02-16 01:17:48,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115523286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:48,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:48,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:17:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419360403] [2023-02-16 01:17:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:48,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:17:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:17:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:17:48,609 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-16 01:17:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:48,664 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-02-16 01:17:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:17:48,664 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-16 01:17:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:48,666 INFO L225 Difference]: With dead ends: 50 [2023-02-16 01:17:48,668 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 01:17:48,668 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-16 01:17:48,669 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-16 01:17:48,669 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-16 01:17:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 01:17:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-02-16 01:17:48,674 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-16 01:17:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-16 01:17:48,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2023-02-16 01:17:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:48,675 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-16 01:17:48,675 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-16 01:17:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-16 01:17:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 01:17:48,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:48,677 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-16 01:17:48,683 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-16 01:17:48,883 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-16 01:17:48,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2023-02-16 01:17:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:48,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36286711] [2023-02-16 01:17:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:48,889 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-16 01:17:48,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:48,890 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-16 01:17:48,892 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-16 01:17:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:48,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 01:17:48,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:48,947 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-16 01:17:48,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:17:48,968 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-16 01:17:48,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:48,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36286711] [2023-02-16 01:17:48,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36286711] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:17:48,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:17:48,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 01:17:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472817391] [2023-02-16 01:17:48,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:17:48,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 01:17:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 01:17:48,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:17:48,970 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-16 01:17:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:49,077 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2023-02-16 01:17:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 01:17:49,078 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-16 01:17:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:49,079 INFO L225 Difference]: With dead ends: 79 [2023-02-16 01:17:49,079 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 01:17:49,079 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-16 01:17:49,080 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-16 01:17:49,080 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-16 01:17:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 01:17:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2023-02-16 01:17:49,084 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-16 01:17:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-02-16 01:17:49,085 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2023-02-16 01:17:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:49,085 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-02-16 01:17:49,085 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-16 01:17:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-02-16 01:17:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 01:17:49,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:49,086 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-16 01:17:49,110 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-16 01:17:49,293 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-16 01:17:49,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2023-02-16 01:17:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:49,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478437737] [2023-02-16 01:17:49,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:17:49,295 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-16 01:17:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:49,296 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-16 01:17:49,298 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-16 01:17:49,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 01:17:49,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:17:49,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 01:17:49,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:49,424 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-16 01:17:49,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:17:49,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:49,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478437737] [2023-02-16 01:17:49,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478437737] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:49,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:49,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 01:17:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50884922] [2023-02-16 01:17:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:49,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 01:17:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:49,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 01:17:49,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 01:17:49,433 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-16 01:17:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:49,477 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-16 01:17:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:17:49,477 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-16 01:17:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:49,478 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:17:49,478 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 01:17:49,479 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-16 01:17:49,479 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-16 01:17:49,480 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-16 01:17:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 01:17:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-16 01:17:49,483 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-16 01:17:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-16 01:17:49,484 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2023-02-16 01:17:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:49,484 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-16 01:17:49,484 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-16 01:17:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-16 01:17:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 01:17:49,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:49,485 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-16 01:17:49,501 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-16 01:17:49,692 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-16 01:17:49,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2023-02-16 01:17:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:49,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417052126] [2023-02-16 01:17:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:49,694 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-16 01:17:49,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:49,695 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-16 01:17:49,697 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-16 01:17:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:17:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:49,783 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-16 01:17:49,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:17:49,854 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-16 01:17:49,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417052126] [2023-02-16 01:17:49,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417052126] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:17:49,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:17:49,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 01:17:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293483168] [2023-02-16 01:17:49,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:17:49,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:17:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:17:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:17:49,857 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-16 01:17:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:50,103 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2023-02-16 01:17:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:17:50,103 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-16 01:17:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:50,104 INFO L225 Difference]: With dead ends: 101 [2023-02-16 01:17:50,104 INFO L226 Difference]: Without dead ends: 74 [2023-02-16 01:17:50,104 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-16 01:17:50,105 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-16 01:17:50,105 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-16 01:17:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-16 01:17:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2023-02-16 01:17:50,109 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-16 01:17:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-02-16 01:17:50,110 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2023-02-16 01:17:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:50,110 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-02-16 01:17:50,110 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-16 01:17:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-02-16 01:17:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:17:50,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:50,111 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-16 01:17:50,120 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 (6)] Ended with exit code 0 [2023-02-16 01:17:50,322 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-16 01:17:50,322 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2023-02-16 01:17:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:50,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567447758] [2023-02-16 01:17:50,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:17:50,325 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-16 01:17:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:50,326 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-16 01:17:50,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 (7)] Waiting until timeout for monitored process [2023-02-16 01:17:50,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 01:17:50,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:17:50,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:17:50,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:50,434 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-16 01:17:50,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:17:50,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:50,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567447758] [2023-02-16 01:17:50,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567447758] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:50,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:50,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:17:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863763649] [2023-02-16 01:17:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:50,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:17:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:17:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:17:50,436 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-16 01:17:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:50,472 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-02-16 01:17:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:17:50,473 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-16 01:17:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:50,473 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:17:50,473 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 01:17:50,474 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-16 01:17:50,474 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-16 01:17:50,475 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-16 01:17:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 01:17:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-02-16 01:17:50,478 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-16 01:17:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-02-16 01:17:50,478 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2023-02-16 01:17:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:50,479 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-02-16 01:17:50,479 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-16 01:17:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-02-16 01:17:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 01:17:50,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:50,480 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-16 01:17:50,488 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-16 01:17:50,691 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-16 01:17:50,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2023-02-16 01:17:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619441824] [2023-02-16 01:17:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:50,694 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-16 01:17:50,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:50,696 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-16 01:17:50,697 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-16 01:17:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:17:50,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 01:17:50,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:17:50,804 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-16 01:17:50,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:17:50,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:17:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619441824] [2023-02-16 01:17:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619441824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:17:50,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:17:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:17:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474415249] [2023-02-16 01:17:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:17:50,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:17:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:17:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:17:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:17:50,806 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-16 01:17:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:17:50,825 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-02-16 01:17:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:17:50,830 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-16 01:17:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:17:50,831 INFO L225 Difference]: With dead ends: 58 [2023-02-16 01:17:50,831 INFO L226 Difference]: Without dead ends: 45 [2023-02-16 01:17:50,831 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-16 01:17:50,832 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-16 01:17:50,832 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-16 01:17:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-16 01:17:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-16 01:17:50,835 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-16 01:17:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-02-16 01:17:50,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2023-02-16 01:17:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:17:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-02-16 01:17:50,836 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-16 01:17:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-02-16 01:17:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 01:17:50,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:17:50,836 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-16 01:17:50,846 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 (8)] Ended with exit code 0 [2023-02-16 01:17:51,040 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-16 01:17:51,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:17:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:17:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2023-02-16 01:17:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:17:51,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892815660] [2023-02-16 01:17:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:17:51,041 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-16 01:17:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:17:51,043 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-16 01:17:51,044 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-16 01:17:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:17:51,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 01:17:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:17:51,264 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 01:17:51,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 01:17:51,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 01:17:51,297 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-16 01:17:51,467 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-16 01:17:51,470 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-02-16 01:17:51,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 01:17:51,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 01:17:51 BoogieIcfgContainer [2023-02-16 01:17:51,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 01:17:51,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 01:17:51,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 01:17:51,497 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 01:17:51,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:17:47" (3/4) ... [2023-02-16 01:17:51,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 01:17:51,538 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 01:17:51,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 01:17:51,539 INFO L158 Benchmark]: Toolchain (without parser) took 4001.24ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 51.4MB in the end (delta: 42.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,539 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:17:51,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.71ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 82.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.61ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,540 INFO L158 Benchmark]: Boogie Preprocessor took 18.76ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,540 INFO L158 Benchmark]: RCFGBuilder took 266.59ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 65.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,540 INFO L158 Benchmark]: TraceAbstraction took 3502.05ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 54.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,541 INFO L158 Benchmark]: Witness Printer took 42.01ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 51.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:17:51,542 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.71ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 82.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.61ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.76ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.59ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 65.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3502.05ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 54.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 42.01ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 51.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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)<