./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:49:05,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:49:05,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:49:05,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:49:05,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:49:05,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:49:05,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:49:05,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:49:05,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:49:05,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:49:05,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:49:05,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:49:05,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:49:05,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:49:05,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:49:05,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:49:05,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:49:05,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:49:05,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:49:05,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:49:05,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:49:05,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:49:05,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:49:05,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:49:05,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:49:05,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:49:05,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:49:05,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:49:05,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:49:05,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:49:05,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:49:05,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:49:05,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:49:05,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:49:05,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:49:05,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:49:05,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:49:05,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:49:05,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:49:05,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:49:05,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:49:05,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:49:05,189 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:49:05,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:49:05,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:49:05,190 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:49:05,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:49:05,191 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:49:05,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:49:05,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:49:05,192 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:49:05,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:49:05,193 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:49:05,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:49:05,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:49:05,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:49:05,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:49:05,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:49:05,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:49:05,194 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:49:05,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:49:05,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:49:05,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:49:05,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:49:05,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:49:05,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:49:05,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:49:05,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:49:05,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:49:05,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:49:05,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:49:05,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:49:05,197 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:49:05,197 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:49:05,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:49:05,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:49:05,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2021-12-15 10:49:05,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:49:05,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:49:05,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:49:05,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:49:05,483 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:49:05,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2021-12-15 10:49:05,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8880ab3/144aedec32344b2b9b70b10918677ba4/FLAGba00341aa [2021-12-15 10:49:06,001 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:49:06,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2021-12-15 10:49:06,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8880ab3/144aedec32344b2b9b70b10918677ba4/FLAGba00341aa [2021-12-15 10:49:06,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8880ab3/144aedec32344b2b9b70b10918677ba4 [2021-12-15 10:49:06,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:49:06,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:49:06,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:06,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:49:06,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:49:06,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120906ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06, skipping insertion in model container [2021-12-15 10:49:06,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:49:06,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:49:06,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-12-15 10:49:06,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:06,226 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:49:06,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-12-15 10:49:06,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:06,272 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:49:06,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06 WrapperNode [2021-12-15 10:49:06,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:06,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:06,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:49:06,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:49:06,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,325 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2021-12-15 10:49:06,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:06,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:49:06,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:49:06,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:49:06,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:49:06,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:49:06,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:49:06,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:49:06,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (1/1) ... [2021-12-15 10:49:06,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:49:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:49:06,425 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) [2021-12-15 10:49:06,440 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 [2021-12-15 10:49:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:49:06,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:49:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:49:06,530 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:49:06,531 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:49:06,680 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:49:06,684 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:49:06,685 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 10:49:06,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:06 BoogieIcfgContainer [2021-12-15 10:49:06,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:49:06,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:49:06,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:49:06,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:49:06,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:49:06" (1/3) ... [2021-12-15 10:49:06,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a94af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:06, skipping insertion in model container [2021-12-15 10:49:06,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:06" (2/3) ... [2021-12-15 10:49:06,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a94af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:06, skipping insertion in model container [2021-12-15 10:49:06,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:06" (3/3) ... [2021-12-15 10:49:06,694 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2021-12-15 10:49:06,698 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:49:06,699 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:49:06,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:49:06,742 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:49:06,742 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:49:06,753 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) [2021-12-15 10:49:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 10:49:06,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:06,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:06,760 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2021-12-15 10:49:06,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933959993] [2021-12-15 10:49:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:06,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:07,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:07,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933959993] [2021-12-15 10:49:07,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933959993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:07,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:07,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:49:07,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625620545] [2021-12-15 10:49:07,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:07,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:49:07,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:49:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:49:07,061 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) [2021-12-15 10:49:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:07,135 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2021-12-15 10:49:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:49:07,138 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 [2021-12-15 10:49:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:07,152 INFO L225 Difference]: With dead ends: 62 [2021-12-15 10:49:07,152 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 10:49:07,157 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:07,162 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:49:07,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 10:49:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-12-15 10:49:07,196 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) [2021-12-15 10:49:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-12-15 10:49:07,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2021-12-15 10:49:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:07,199 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-15 10:49:07,199 INFO L471 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) [2021-12-15 10:49:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-12-15 10:49:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 10:49:07,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:07,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:07,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:49:07,203 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2021-12-15 10:49:07,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:07,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089399024] [2021-12-15 10:49:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:07,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:49:07,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:07,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089399024] [2021-12-15 10:49:07,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089399024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:49:07,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822157635] [2021-12-15 10:49:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:07,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:49:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:49:07,298 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) [2021-12-15 10:49:07,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 10:49:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:07,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 10:49:07,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:49:07,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:49:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:49:07,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822157635] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:49:07,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:49:07,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 10:49:07,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898228377] [2021-12-15 10:49:07,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:49:07,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:49:07,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:49:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:49:07,587 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) [2021-12-15 10:49:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:07,674 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2021-12-15 10:49:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:49:07,675 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 [2021-12-15 10:49:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:07,676 INFO L225 Difference]: With dead ends: 79 [2021-12-15 10:49:07,676 INFO L226 Difference]: Without dead ends: 60 [2021-12-15 10:49:07,677 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:07,678 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:07,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:49:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-15 10:49:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-12-15 10:49:07,684 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) [2021-12-15 10:49:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-12-15 10:49:07,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2021-12-15 10:49:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:07,685 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-15 10:49:07,686 INFO L471 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) [2021-12-15 10:49:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-12-15 10:49:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 10:49:07,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:07,687 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:07,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:07,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:49:07,904 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2021-12-15 10:49:07,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:07,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15511587] [2021-12-15 10:49:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:07,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 10:49:08,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:08,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15511587] [2021-12-15 10:49:08,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15511587] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:49:08,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953253346] [2021-12-15 10:49:08,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:49:08,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:49:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:49:08,017 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) [2021-12-15 10:49:08,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 10:49:08,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:49:08,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:49:08,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:49:08,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 10:49:08,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:49:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 10:49:08,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953253346] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:49:08,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:49:08,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-15 10:49:08,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77921955] [2021-12-15 10:49:08,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:49:08,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 10:49:08,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 10:49:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:49:08,287 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) [2021-12-15 10:49:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:08,369 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2021-12-15 10:49:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 10:49:08,369 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 [2021-12-15 10:49:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:08,370 INFO L225 Difference]: With dead ends: 95 [2021-12-15 10:49:08,370 INFO L226 Difference]: Without dead ends: 70 [2021-12-15 10:49:08,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:49:08,372 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:08,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:49:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-15 10:49:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2021-12-15 10:49:08,378 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) [2021-12-15 10:49:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-15 10:49:08,379 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2021-12-15 10:49:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:08,379 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 10:49:08,379 INFO L471 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) [2021-12-15 10:49:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-15 10:49:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 10:49:08,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:08,381 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:08,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:08,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-15 10:49:08,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 3 times [2021-12-15 10:49:08,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:08,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478780397] [2021-12-15 10:49:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:08,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:49:08,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 10:49:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:49:08,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 10:49:08,730 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 10:49:08,731 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 10:49:08,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:49:08,735 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1] [2021-12-15 10:49:08,737 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 10:49:08,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:49:08 BoogieIcfgContainer [2021-12-15 10:49:08,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 10:49:08,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 10:49:08,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 10:49:08,768 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 10:49:08,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:06" (3/4) ... [2021-12-15 10:49:08,770 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 10:49:08,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 10:49:08,771 INFO L158 Benchmark]: Toolchain (without parser) took 2739.14ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 68.4MB in the beginning and 69.9MB in the end (delta: -1.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2021-12-15 10:49:08,771 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 10:49:08,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.27ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 74.9MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 10:49:08,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.23ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:08,772 INFO L158 Benchmark]: Boogie Preprocessor took 45.91ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 71.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 10:49:08,773 INFO L158 Benchmark]: RCFGBuilder took 313.31ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 61.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 10:49:08,773 INFO L158 Benchmark]: TraceAbstraction took 2079.21ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 60.3MB in the beginning and 69.9MB in the end (delta: -9.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:08,773 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 123.7MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 10:49:08,775 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.22ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.27ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 74.9MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.23ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.91ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 71.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.31ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 61.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2079.21ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 60.3MB in the beginning and 69.9MB in the end (delta: -9.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 123.7MB. Free memory is still 69.9MB. 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 [2021-12-15 10:49:11,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:49:11,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:49:11,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:49:11,275 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:49:11,276 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:49:11,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2021-12-15 10:49:11,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad0a1740/2fdcbc96a9104a14b7ebf17300febce5/FLAG321ea9df8 [2021-12-15 10:49:11,765 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:49:11,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2021-12-15 10:49:11,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad0a1740/2fdcbc96a9104a14b7ebf17300febce5/FLAG321ea9df8 [2021-12-15 10:49:12,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad0a1740/2fdcbc96a9104a14b7ebf17300febce5 [2021-12-15 10:49:12,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:49:12,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:49:12,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:12,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:49:12,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:49:12,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c1b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12, skipping insertion in model container [2021-12-15 10:49:12,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:49:12,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:49:12,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-12-15 10:49:12,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:12,405 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:49:12,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-12-15 10:49:12,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:12,465 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:49:12,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12 WrapperNode [2021-12-15 10:49:12,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:12,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:12,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:49:12,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:49:12,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,520 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2021-12-15 10:49:12,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:12,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:49:12,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:49:12,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:49:12,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:49:12,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:49:12,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:49:12,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:49:12,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (1/1) ... [2021-12-15 10:49:12,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:49:12,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:49:12,600 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) [2021-12-15 10:49:12,626 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 [2021-12-15 10:49:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:49:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-15 10:49:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 10:49:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 10:49:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:49:12,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:49:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-15 10:49:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:49:12,727 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:49:12,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:49:12,965 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:49:12,970 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:49:12,979 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 10:49:12,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:12 BoogieIcfgContainer [2021-12-15 10:49:12,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:49:12,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:49:12,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:49:12,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:49:12,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:49:12" (1/3) ... [2021-12-15 10:49:12,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237ebc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:12, skipping insertion in model container [2021-12-15 10:49:12,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:12" (2/3) ... [2021-12-15 10:49:12,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237ebc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:12, skipping insertion in model container [2021-12-15 10:49:12,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:12" (3/3) ... [2021-12-15 10:49:12,987 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2021-12-15 10:49:13,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:49:13,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:49:13,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:49:13,063 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:49:13,063 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:49:13,079 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) [2021-12-15 10:49:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 10:49:13,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:13,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:13,086 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2021-12-15 10:49:13,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:13,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470778640] [2021-12-15 10:49:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:13,102 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:13,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:13,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:13,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 10:49:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:13,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 10:49:13,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:13,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:49:13,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:13,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470778640] [2021-12-15 10:49:13,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470778640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:13,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:13,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 10:49:13,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574950857] [2021-12-15 10:49:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:13,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 10:49:13,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 10:49:13,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 10:49:13,325 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) [2021-12-15 10:49:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:13,347 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2021-12-15 10:49:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 10:49:13,351 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 [2021-12-15 10:49:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:13,359 INFO L225 Difference]: With dead ends: 48 [2021-12-15 10:49:13,360 INFO L226 Difference]: Without dead ends: 22 [2021-12-15 10:49:13,363 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:13,368 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:49:13,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-15 10:49:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-15 10:49:13,398 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) [2021-12-15 10:49:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-15 10:49:13,400 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2021-12-15 10:49:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:13,400 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 10:49:13,401 INFO L471 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) [2021-12-15 10:49:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-12-15 10:49:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 10:49:13,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:13,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:13,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:13,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:13,614 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2021-12-15 10:49:13,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:13,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155176475] [2021-12-15 10:49:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:13,617 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:13,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:13,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:13,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 10:49:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:13,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 10:49:13,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:13,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:49:13,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155176475] [2021-12-15 10:49:13,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155176475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:13,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:13,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:49:13,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308341434] [2021-12-15 10:49:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:13,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:49:13,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:49:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:49:13,742 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) [2021-12-15 10:49:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:13,799 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2021-12-15 10:49:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:49:13,800 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 [2021-12-15 10:49:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:13,802 INFO L225 Difference]: With dead ends: 50 [2021-12-15 10:49:13,802 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 10:49:13,803 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:13,804 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:49:13,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 10:49:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-12-15 10:49:13,809 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) [2021-12-15 10:49:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-12-15 10:49:13,810 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2021-12-15 10:49:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:13,810 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-15 10:49:13,810 INFO L471 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) [2021-12-15 10:49:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-12-15 10:49:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 10:49:13,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:13,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:13,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:14,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:14,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2021-12-15 10:49:14,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:14,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415979767] [2021-12-15 10:49:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:14,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:14,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 10:49:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:14,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 10:49:14,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:49:14,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:49:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:49:14,260 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:14,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415979767] [2021-12-15 10:49:14,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415979767] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:49:14,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 10:49:14,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-15 10:49:14,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251007138] [2021-12-15 10:49:14,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 10:49:14,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:49:14,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:49:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:49:14,268 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) [2021-12-15 10:49:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:14,435 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2021-12-15 10:49:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:49:14,436 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 [2021-12-15 10:49:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:14,437 INFO L225 Difference]: With dead ends: 79 [2021-12-15 10:49:14,437 INFO L226 Difference]: Without dead ends: 60 [2021-12-15 10:49:14,438 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:14,439 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:14,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:49:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-15 10:49:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-12-15 10:49:14,445 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) [2021-12-15 10:49:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-12-15 10:49:14,446 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2021-12-15 10:49:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:14,447 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-15 10:49:14,447 INFO L471 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) [2021-12-15 10:49:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-12-15 10:49:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 10:49:14,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:14,448 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:14,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:14,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:14,657 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2021-12-15 10:49:14,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:14,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105426814] [2021-12-15 10:49:14,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:49:14,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:14,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:14,660 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:14,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 10:49:14,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 10:49:14,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:49:14,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 10:49:14,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-15 10:49:14,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:49:14,867 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:14,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105426814] [2021-12-15 10:49:14,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105426814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:14,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:14,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:49:14,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982676872] [2021-12-15 10:49:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:14,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:49:14,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:49:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:14,869 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) [2021-12-15 10:49:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:14,920 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2021-12-15 10:49:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 10:49:14,920 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 [2021-12-15 10:49:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:14,921 INFO L225 Difference]: With dead ends: 48 [2021-12-15 10:49:14,921 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 10:49:14,922 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:14,923 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 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 [2021-12-15 10:49:14,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 10:49:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 10:49:14,927 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) [2021-12-15 10:49:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-12-15 10:49:14,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2021-12-15 10:49:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:14,929 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-12-15 10:49:14,929 INFO L471 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) [2021-12-15 10:49:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-12-15 10:49:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:49:14,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:14,939 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:49:14,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:15,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:15,148 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2021-12-15 10:49:15,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:15,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364731179] [2021-12-15 10:49:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:15,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:15,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:15,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 10:49:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:15,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:49:15,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 10:49:15,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:49:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 10:49:15,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364731179] [2021-12-15 10:49:15,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364731179] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:49:15,509 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 10:49:15,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-15 10:49:15,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586383307] [2021-12-15 10:49:15,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 10:49:15,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 10:49:15,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 10:49:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-15 10:49:15,511 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) [2021-12-15 10:49:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:15,837 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2021-12-15 10:49:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 10:49:15,839 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 [2021-12-15 10:49:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:15,840 INFO L225 Difference]: With dead ends: 101 [2021-12-15 10:49:15,840 INFO L226 Difference]: Without dead ends: 74 [2021-12-15 10:49:15,841 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:15,841 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:15,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 133 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 10:49:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-15 10:49:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2021-12-15 10:49:15,847 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) [2021-12-15 10:49:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-15 10:49:15,848 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2021-12-15 10:49:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:15,849 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-15 10:49:15,849 INFO L471 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) [2021-12-15 10:49:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-15 10:49:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 10:49:15,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:15,850 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:49:15,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:16,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,060 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2021-12-15 10:49:16,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:16,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210356461] [2021-12-15 10:49:16,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:49:16,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:16,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:16,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 10:49:16,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 10:49:16,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:49:16,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:49:16,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-15 10:49:16,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:49:16,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210356461] [2021-12-15 10:49:16,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210356461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:16,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:16,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:16,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994002783] [2021-12-15 10:49:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:16,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:16,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:16,254 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) [2021-12-15 10:49:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:16,302 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2021-12-15 10:49:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:16,302 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 [2021-12-15 10:49:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:16,303 INFO L225 Difference]: With dead ends: 48 [2021-12-15 10:49:16,303 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 10:49:16,304 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:16,308 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:49:16,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 10:49:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-12-15 10:49:16,321 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) [2021-12-15 10:49:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2021-12-15 10:49:16,322 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2021-12-15 10:49:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:16,322 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2021-12-15 10:49:16,322 INFO L471 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) [2021-12-15 10:49:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2021-12-15 10:49:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 10:49:16,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:16,324 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:49:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:16,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,524 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2021-12-15 10:49:16,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:16,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220192343] [2021-12-15 10:49:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:16,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:16,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:16,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 10:49:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:16,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 10:49:16,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:49:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-15 10:49:16,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:49:16,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 10:49:16,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220192343] [2021-12-15 10:49:16,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220192343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:16,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:16,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:16,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265246032] [2021-12-15 10:49:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:16,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:16,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 10:49:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:16,709 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) [2021-12-15 10:49:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:16,730 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2021-12-15 10:49:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:16,731 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 [2021-12-15 10:49:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:16,734 INFO L225 Difference]: With dead ends: 58 [2021-12-15 10:49:16,734 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 10:49:16,734 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:49:16,737 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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 [2021-12-15 10:49:16,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 10:49:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-12-15 10:49:16,748 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) [2021-12-15 10:49:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-12-15 10:49:16,754 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2021-12-15 10:49:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:16,754 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-12-15 10:49:16,755 INFO L471 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) [2021-12-15 10:49:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-12-15 10:49:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 10:49:16,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:16,761 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:49:16,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:16,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,974 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2021-12-15 10:49:16,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 10:49:16,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168742191] [2021-12-15 10:49:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:16,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 10:49:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 10:49:16,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 10:49:16,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 10:49:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:49:17,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 10:49:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:49:17,225 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-15 10:49:17,225 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 10:49:17,226 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 10:49:17,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-15 10:49:17,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 10:49:17,431 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2021-12-15 10:49:17,434 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 10:49:17,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:49:17 BoogieIcfgContainer [2021-12-15 10:49:17,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 10:49:17,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 10:49:17,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 10:49:17,481 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 10:49:17,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:12" (3/4) ... [2021-12-15 10:49:17,483 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 10:49:17,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 10:49:17,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 10:49:17,572 INFO L158 Benchmark]: Toolchain (without parser) took 5401.78ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 31.5MB in the beginning and 46.9MB in the end (delta: -15.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,573 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 10:49:17,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.67ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 48.4MB in the end (delta: -17.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,573 INFO L158 Benchmark]: Boogie Preprocessor took 48.43ms. Allocated memory is still 67.1MB. Free memory was 46.6MB in the beginning and 45.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,574 INFO L158 Benchmark]: RCFGBuilder took 410.31ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 48.5MB in the end (delta: -3.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,574 INFO L158 Benchmark]: TraceAbstraction took 4497.52ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 48.0MB in the beginning and 50.3MB in the end (delta: -2.3MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,574 INFO L158 Benchmark]: Witness Printer took 91.70ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:49:17,576 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.67ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 48.4MB in the end (delta: -17.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.43ms. Allocated memory is still 67.1MB. Free memory was 46.6MB in the beginning and 45.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.31ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 48.5MB in the end (delta: -3.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4497.52ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 48.0MB in the beginning and 50.3MB in the end (delta: -2.3MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 91.70ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). 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)<