./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_10x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/recursive-simple/sum_10x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:09:07,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:09:07,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:09:07,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:09:07,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:09:07,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:09:07,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:09:07,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:09:07,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:09:07,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:09:07,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:09:07,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:09:07,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:09:07,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:09:07,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:09:07,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:09:07,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:09:07,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:09:07,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:09:07,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:09:07,314 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:09:07,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:09:07,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:09:07,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:09:07,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:09:07,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:09:07,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:09:07,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:09:07,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:09:07,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:09:07,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:09:07,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:09:07,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:09:07,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:09:07,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:09:07,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:09:07,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:09:07,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:09:07,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:09:07,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:09:07,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:09:07,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:09:07,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:09:07,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:09:07,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:09:07,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:09:07,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:09:07,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:09:07,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:09:07,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:09:07,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:09:07,380 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:09:07,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:09:07,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:09:07,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:09:07,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:09:07,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:09:07,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:09:07,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:09:07,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:09:07,383 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:09:07,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:09:07,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:09:07,383 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 -> 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b [2022-07-21 05:09:07,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:09:07,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:09:07,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:09:07,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:09:07,729 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:09:07,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2022-07-21 05:09:07,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf977bc7/924653c4fd6b4069a20ca5e3f76de338/FLAG43e4dedae [2022-07-21 05:09:08,231 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:09:08,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2022-07-21 05:09:08,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf977bc7/924653c4fd6b4069a20ca5e3f76de338/FLAG43e4dedae [2022-07-21 05:09:08,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf977bc7/924653c4fd6b4069a20ca5e3f76de338 [2022-07-21 05:09:08,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:09:08,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:09:08,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:09:08,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:09:08,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:09:08,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eee09f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08, skipping insertion in model container [2022-07-21 05:09:08,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:09:08,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:09:08,430 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/recursive-simple/sum_10x0-2.c[481,494] [2022-07-21 05:09:08,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:09:08,444 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:09:08,476 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/recursive-simple/sum_10x0-2.c[481,494] [2022-07-21 05:09:08,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:09:08,500 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:09:08,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08 WrapperNode [2022-07-21 05:09:08,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:09:08,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:09:08,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:09:08,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:09:08,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,528 INFO L137 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-07-21 05:09:08,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:09:08,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:09:08,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:09:08,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:09:08,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:09:08,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:09:08,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:09:08,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:09:08,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (1/1) ... [2022-07-21 05:09:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:09:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:08,580 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) [2022-07-21 05:09:08,595 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 [2022-07-21 05:09:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:09:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:09:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:09:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-07-21 05:09:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-07-21 05:09:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:09:08,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:09:08,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:09:08,782 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:09:08,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:09:08,790 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:09:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:09:08 BoogieIcfgContainer [2022-07-21 05:09:08,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:09:08,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:09:08,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:09:08,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:09:08,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:09:08" (1/3) ... [2022-07-21 05:09:08,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772c7694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:09:08, skipping insertion in model container [2022-07-21 05:09:08,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:09:08" (2/3) ... [2022-07-21 05:09:08,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772c7694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:09:08, skipping insertion in model container [2022-07-21 05:09:08,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:09:08" (3/3) ... [2022-07-21 05:09:08,803 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2022-07-21 05:09:08,816 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:09:08,817 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:09:08,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:09:08,886 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bb5e353, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a33dd19 [2022-07-21 05:09:08,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:09:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 05:09:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:09:08,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:08,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:08,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-21 05:09:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514572530] [2022-07-21 05:09:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:09:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514572530] [2022-07-21 05:09:09,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514572530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:09:09,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:09:09,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:09:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026346023] [2022-07-21 05:09:09,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:09:09,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:09:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:09,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:09:09,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:09:09,192 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:09:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:09,255 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-21 05:09:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:09:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-21 05:09:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:09,263 INFO L225 Difference]: With dead ends: 25 [2022-07-21 05:09:09,263 INFO L226 Difference]: Without dead ends: 15 [2022-07-21 05:09:09,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:09:09,272 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 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 [2022-07-21 05:09:09,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-21 05:09:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-21 05:09:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 05:09:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-21 05:09:09,314 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-21 05:09:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:09,314 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-21 05:09:09,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:09:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-21 05:09:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 05:09:09,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:09,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:09,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:09:09,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-21 05:09:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:09,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258262200] [2022-07-21 05:09:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:09,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 05:09:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:09,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258262200] [2022-07-21 05:09:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258262200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034668237] [2022-07-21 05:09:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:09,422 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) [2022-07-21 05:09:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:09:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:09,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:09:09,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 05:09:09,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:09:09,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034668237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:09,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:09,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2022-07-21 05:09:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790802191] [2022-07-21 05:09:09,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:09,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 05:09:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 05:09:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:09:09,700 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 05:09:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:09,762 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-21 05:09:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:09:09,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-07-21 05:09:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:09,764 INFO L225 Difference]: With dead ends: 22 [2022-07-21 05:09:09,764 INFO L226 Difference]: Without dead ends: 18 [2022-07-21 05:09:09,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:09:09,766 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:09,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-21 05:09:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-21 05:09:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 05:09:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-21 05:09:09,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-21 05:09:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:09,772 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-21 05:09:09,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 05:09:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-21 05:09:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 05:09:09,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:09,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:09,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:09,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:09,999 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-21 05:09:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:10,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531380030] [2022-07-21 05:09:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:09:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:10,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531380030] [2022-07-21 05:09:10,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531380030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:10,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937661674] [2022-07-21 05:09:10,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:09:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:10,124 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) [2022-07-21 05:09:10,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:09:10,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:09:10,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:10,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:09:10,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:09:10,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 05:09:10,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937661674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:10,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:10,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-07-21 05:09:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616587972] [2022-07-21 05:09:10,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:10,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 05:09:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 05:09:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:09:10,516 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 05:09:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:10,562 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 05:09:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:09:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-07-21 05:09:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:10,564 INFO L225 Difference]: With dead ends: 25 [2022-07-21 05:09:10,564 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 05:09:10,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-21 05:09:10,566 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:10,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 05:09:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 05:09:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:09:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-21 05:09:10,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-21 05:09:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:10,572 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-21 05:09:10,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 05:09:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-21 05:09:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 05:09:10,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:10,573 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:10,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 05:09:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 05:09:10,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-21 05:09:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:10,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563662722] [2022-07-21 05:09:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:09:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:10,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563662722] [2022-07-21 05:09:10,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563662722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:10,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76062169] [2022-07-21 05:09:10,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:09:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:10,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:10,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:09:11,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 05:09:11,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:11,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:09:11,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:09:11,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 05:09:11,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76062169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:11,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-07-21 05:09:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124078870] [2022-07-21 05:09:11,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 05:09:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 05:09:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 05:09:11,498 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-21 05:09:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:11,553 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-21 05:09:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 05:09:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 28 [2022-07-21 05:09:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:11,555 INFO L225 Difference]: With dead ends: 28 [2022-07-21 05:09:11,556 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 05:09:11,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-07-21 05:09:11,557 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 41 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 05:09:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 05:09:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:09:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-21 05:09:11,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2022-07-21 05:09:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:11,563 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-21 05:09:11,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-21 05:09:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-21 05:09:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 05:09:11,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:11,571 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:11,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:11,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:11,786 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2022-07-21 05:09:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818422304] [2022-07-21 05:09:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-21 05:09:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818422304] [2022-07-21 05:09:11,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818422304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665425008] [2022-07-21 05:09:11,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:09:11,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:11,965 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:11,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:09:12,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:09:12,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:12,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 05:09:12,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-21 05:09:12,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 05:09:12,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665425008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:12,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:12,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2022-07-21 05:09:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722373363] [2022-07-21 05:09:12,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:12,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 05:09:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:12,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 05:09:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:09:12,706 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-21 05:09:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:12,774 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-21 05:09:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:09:12,775 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 34 [2022-07-21 05:09:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:12,775 INFO L225 Difference]: With dead ends: 31 [2022-07-21 05:09:12,776 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 05:09:12,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-21 05:09:12,777 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:12,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 05:09:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-21 05:09:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 05:09:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-21 05:09:12,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2022-07-21 05:09:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:12,782 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-21 05:09:12,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-21 05:09:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-21 05:09:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 05:09:12,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:12,784 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:12,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:12,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:12,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2022-07-21 05:09:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981987922] [2022-07-21 05:09:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 05:09:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:13,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981987922] [2022-07-21 05:09:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981987922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:13,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760340173] [2022-07-21 05:09:13,128 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:09:13,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:13,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:13,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:13,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:09:13,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-21 05:09:13,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:13,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 05:09:13,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 05:09:13,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:09:14,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760340173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:14,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:14,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2022-07-21 05:09:14,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568364796] [2022-07-21 05:09:14,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:14,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 05:09:14,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 05:09:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-21 05:09:14,114 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-07-21 05:09:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:14,198 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-21 05:09:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:09:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 40 [2022-07-21 05:09:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:14,206 INFO L225 Difference]: With dead ends: 34 [2022-07-21 05:09:14,206 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 05:09:14,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-07-21 05:09:14,209 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:14,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 05:09:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 05:09:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:09:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-21 05:09:14,214 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2022-07-21 05:09:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:14,214 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-21 05:09:14,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-07-21 05:09:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-21 05:09:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 05:09:14,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:14,215 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:14,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:14,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2022-07-21 05:09:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472963804] [2022-07-21 05:09:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 05:09:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472963804] [2022-07-21 05:09:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472963804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464907651] [2022-07-21 05:09:14,586 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 05:09:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:14,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:14,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:09:14,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-21 05:09:14,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:14,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 05:09:14,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 05:09:14,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 05:09:15,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464907651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:15,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-07-21 05:09:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283822361] [2022-07-21 05:09:15,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:09:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:09:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:09:15,971 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 05:09:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:16,076 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-07-21 05:09:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:09:16,077 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 46 [2022-07-21 05:09:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:16,081 INFO L225 Difference]: With dead ends: 37 [2022-07-21 05:09:16,081 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 05:09:16,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2022-07-21 05:09:16,082 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 67 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 05:09:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 05:09:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 05:09:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-21 05:09:16,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2022-07-21 05:09:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:16,100 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-21 05:09:16,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 05:09:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-21 05:09:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:09:16,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:16,104 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:16,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:16,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:16,314 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2022-07-21 05:09:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:16,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655763203] [2022-07-21 05:09:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 05:09:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655763203] [2022-07-21 05:09:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655763203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667679084] [2022-07-21 05:09:16,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 05:09:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:16,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:16,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 05:09:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 05:09:16,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 05:09:16,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 05:09:18,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667679084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:18,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:18,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2022-07-21 05:09:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580039167] [2022-07-21 05:09:18,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:18,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 05:09:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:18,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 05:09:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-21 05:09:18,302 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-21 05:09:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:18,417 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-21 05:09:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:09:18,418 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-07-21 05:09:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:18,419 INFO L225 Difference]: With dead ends: 40 [2022-07-21 05:09:18,419 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 05:09:18,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=283, Invalid=587, Unknown=0, NotChecked=0, Total=870 [2022-07-21 05:09:18,420 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 150 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:18,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 61 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:09:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 05:09:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 05:09:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 05:09:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-21 05:09:18,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-21 05:09:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:18,425 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-21 05:09:18,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-21 05:09:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-21 05:09:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:09:18,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:18,426 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:18,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:18,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2022-07-21 05:09:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487177550] [2022-07-21 05:09:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 05:09:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487177550] [2022-07-21 05:09:18,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487177550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368001056] [2022-07-21 05:09:18,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:09:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:18,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:18,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:18,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 05:09:18,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:09:18,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:19,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 05:09:19,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 05:09:19,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-21 05:09:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368001056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:21,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2022-07-21 05:09:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817699280] [2022-07-21 05:09:21,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:21,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 05:09:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 05:09:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-07-21 05:09:21,216 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-21 05:09:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:21,323 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-21 05:09:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:09:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 58 [2022-07-21 05:09:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:21,326 INFO L225 Difference]: With dead ends: 43 [2022-07-21 05:09:21,326 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 05:09:21,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=344, Invalid=712, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 05:09:21,327 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:21,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 79 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:09:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 05:09:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-21 05:09:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 05:09:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-21 05:09:21,342 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2022-07-21 05:09:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:21,342 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-21 05:09:21,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-21 05:09:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-21 05:09:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 05:09:21,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:21,345 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:21,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 05:09:21,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2022-07-21 05:09:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:21,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588967008] [2022-07-21 05:09:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:09:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:09:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-21 05:09:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:09:21,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588967008] [2022-07-21 05:09:21,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588967008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:09:21,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289966268] [2022-07-21 05:09:21,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:09:21,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:09:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:09:21,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:09:21,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 05:09:21,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-07-21 05:09:21,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:09:21,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 05:09:21,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:09:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-21 05:09:22,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 05:09:24,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289966268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:24,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:24,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2022-07-21 05:09:24,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764829502] [2022-07-21 05:09:24,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:24,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 05:09:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 05:09:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-07-21 05:09:24,614 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-21 05:09:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:24,732 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-21 05:09:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 05:09:24,735 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 64 [2022-07-21 05:09:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:24,736 INFO L225 Difference]: With dead ends: 46 [2022-07-21 05:09:24,736 INFO L226 Difference]: Without dead ends: 42 [2022-07-21 05:09:24,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 05:09:24,738 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 110 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:24,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:09:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-21 05:09:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-21 05:09:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:09:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-21 05:09:24,742 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2022-07-21 05:09:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:24,743 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-21 05:09:24,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-21 05:09:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-21 05:09:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 05:09:24,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:24,744 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:24,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:24,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 05:09:24,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2022-07-21 05:09:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:24,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236112125] [2022-07-21 05:09:24,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:24,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:09:24,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:09:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:09:25,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:09:25,014 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:09:25,015 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:09:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 05:09:25,020 INFO L356 BasicCegarLoop]: Path program histogram: [10, 1] [2022-07-21 05:09:25,023 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:09:25,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:09:25 BoogieIcfgContainer [2022-07-21 05:09:25,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:09:25,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:09:25,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:09:25,055 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:09:25,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:09:08" (3/4) ... [2022-07-21 05:09:25,057 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:09:25,090 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:09:25,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:09:25,091 INFO L158 Benchmark]: Toolchain (without parser) took 16833.04ms. Allocated memory was 50.3MB in the beginning and 130.0MB in the end (delta: 79.7MB). Free memory was 25.8MB in the beginning and 49.1MB in the end (delta: -23.2MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2022-07-21 05:09:25,092 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:09:25,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.67ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.6MB in the beginning and 44.9MB in the end (delta: -19.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-07-21 05:09:25,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.01ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:09:25,092 INFO L158 Benchmark]: Boogie Preprocessor took 20.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 42.5MB in the end (delta: 867.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:09:25,093 INFO L158 Benchmark]: RCFGBuilder took 241.29ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 34.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:09:25,093 INFO L158 Benchmark]: TraceAbstraction took 16258.06ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 33.7MB in the beginning and 52.2MB in the end (delta: -18.5MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2022-07-21 05:09:25,093 INFO L158 Benchmark]: Witness Printer took 35.84ms. Allocated memory is still 130.0MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:09:25,095 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.19ms. Allocated memory is still 50.3MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.67ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.6MB in the beginning and 44.9MB in the end (delta: -19.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.01ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 42.5MB in the end (delta: 867.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 241.29ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 34.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16258.06ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 33.7MB in the beginning and 52.2MB in the end (delta: -18.5MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 35.84ms. Allocated memory is still 130.0MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 10; [L15] int b = 0; VAL [a=10, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L18] reach_error() VAL [a=10, b=0, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 493 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 92 mSDtfsCounter, 493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 749 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 800 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 3041 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1065/2700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 05:09:25,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE