./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.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/verifythis/prefixsum_rec.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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:10:40,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:10:40,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:10:40,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:10:40,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:10:40,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:10:40,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:10:40,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:10:40,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:10:40,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:10:40,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:10:40,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:10:40,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:10:40,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:10:40,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:10:40,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:10:40,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:10:40,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:10:40,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:10:40,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:10:40,383 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:10:40,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:10:40,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:10:40,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:10:40,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:10:40,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:10:40,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:10:40,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:10:40,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:10:40,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:10:40,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:10:40,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:10:40,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:10:40,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:10:40,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:10:40,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:10:40,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:10:40,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:10:40,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:10:40,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:10:40,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:10:40,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:10:40,412 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:10:40,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:10:40,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:10:40,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:10:40,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:10:40,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:10:40,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:10:40,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:10:40,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:10:40,446 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:10:40,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:10:40,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:10:40,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:10:40,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:10:40,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:10:40,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:10:40,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:10:40,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:10:40,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:10:40,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:10:40,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:10:40,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:10:40,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:10:40,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:10:40,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:10:40,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:10:40,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:10:40,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:10:40,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:10:40,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:10:40,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:10:40,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:10:40,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:10:40,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:10:40,458 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-07-21 05:10:40,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:10:40,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:10:40,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:10:40,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:10:40,785 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:10:40,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-21 05:10:40,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d317f291c/da80af908c754419a7b6dad4c3331ae4/FLAG7e0ed3513 [2022-07-21 05:10:41,227 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:10:41,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-21 05:10:41,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d317f291c/da80af908c754419a7b6dad4c3331ae4/FLAG7e0ed3513 [2022-07-21 05:10:41,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d317f291c/da80af908c754419a7b6dad4c3331ae4 [2022-07-21 05:10:41,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:10:41,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:10:41,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:10:41,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:10:41,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:10:41,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ac2ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41, skipping insertion in model container [2022-07-21 05:10:41,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:10:41,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:10:41,422 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/verifythis/prefixsum_rec.c[525,538] [2022-07-21 05:10:41,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:10:41,503 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:10:41,533 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/verifythis/prefixsum_rec.c[525,538] [2022-07-21 05:10:41,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:10:41,564 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:10:41,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41 WrapperNode [2022-07-21 05:10:41,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:10:41,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:10:41,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:10:41,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:10:41,578 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:10:41" (1/1) ... [2022-07-21 05:10:41,596 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:10:41" (1/1) ... [2022-07-21 05:10:41,623 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-07-21 05:10:41,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:10:41,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:10:41,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:10:41,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:10:41,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:10:41,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:10:41,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:10:41,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:10:41,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (1/1) ... [2022-07-21 05:10:41,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:10:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:10:41,692 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:10:41,718 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:10:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:10:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 05:10:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 05:10:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:10:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-07-21 05:10:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-07-21 05:10:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 05:10:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 05:10:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-07-21 05:10:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-07-21 05:10:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:10:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:10:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 05:10:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 05:10:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 05:10:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 05:10:41,827 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:10:41,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:10:44,187 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:10:44,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:10:44,201 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 05:10:44,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:10:44 BoogieIcfgContainer [2022-07-21 05:10:44,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:10:44,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:10:44,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:10:44,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:10:44,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:10:41" (1/3) ... [2022-07-21 05:10:44,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566f86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:10:44, skipping insertion in model container [2022-07-21 05:10:44,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:10:41" (2/3) ... [2022-07-21 05:10:44,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566f86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:10:44, skipping insertion in model container [2022-07-21 05:10:44,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:10:44" (3/3) ... [2022-07-21 05:10:44,209 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-07-21 05:10:44,220 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:10:44,220 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:10:44,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:10:44,261 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@5943405f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@269661e9 [2022-07-21 05:10:44,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:10:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 05:10:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 05:10:44,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:10:44,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:10:44,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:10:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:10:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2022-07-21 05:10:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:10:44,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405635892] [2022-07-21 05:10:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:10:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:10:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:10:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:10:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:10:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 05:10:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:10:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:10:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:10:44,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405635892] [2022-07-21 05:10:44,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405635892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:10:44,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:10:44,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 05:10:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766509329] [2022-07-21 05:10:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:10:44,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:10:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:10:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:10:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:10:44,600 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:10:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:10:44,703 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-21 05:10:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:10:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-21 05:10:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:10:44,711 INFO L225 Difference]: With dead ends: 96 [2022-07-21 05:10:44,712 INFO L226 Difference]: Without dead ends: 46 [2022-07-21 05:10:44,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:10:44,718 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:10:44,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:10:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-21 05:10:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-21 05:10:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 05:10:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-21 05:10:44,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2022-07-21 05:10:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:10:44,759 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-21 05:10:44,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:10:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-21 05:10:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 05:10:44,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:10:44,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:10:44,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:10:44,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:10:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:10:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2022-07-21 05:10:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:10:44,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644005740] [2022-07-21 05:10:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:10:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:10:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:44,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:10:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:10:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:10:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 05:10:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:10:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:10:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:10:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644005740] [2022-07-21 05:10:45,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644005740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:10:45,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:10:45,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:10:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951619663] [2022-07-21 05:10:45,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:10:45,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:10:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:10:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:10:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:10:45,069 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:10:47,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:10:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:10:47,516 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-07-21 05:10:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:10:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-21 05:10:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:10:47,518 INFO L225 Difference]: With dead ends: 87 [2022-07-21 05:10:47,518 INFO L226 Difference]: Without dead ends: 71 [2022-07-21 05:10:47,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:10:47,520 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:10:47,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 05:10:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-21 05:10:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-07-21 05:10:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 05:10:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-21 05:10:47,533 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2022-07-21 05:10:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:10:47,533 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-21 05:10:47,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:10:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-21 05:10:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 05:10:47,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:10:47,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:10:47,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:10:47,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:10:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:10:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2022-07-21 05:10:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:10:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170170736] [2022-07-21 05:10:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:10:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:10:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:10:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:10:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:10:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 05:10:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:10:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:10:47,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:10:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170170736] [2022-07-21 05:10:47,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170170736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:10:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081791768] [2022-07-21 05:10:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:47,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:10:47,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:10:47,692 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:10:47,715 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:10:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:47,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:10:47,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:10:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:10:47,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:10:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:10:48,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081791768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:10:48,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:10:48,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-21 05:10:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443445817] [2022-07-21 05:10:48,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:10:48,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:10:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:10:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:10:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:10:48,172 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 05:10:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:10:48,422 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-21 05:10:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:10:48,424 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2022-07-21 05:10:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:10:48,425 INFO L225 Difference]: With dead ends: 73 [2022-07-21 05:10:48,425 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 05:10:48,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:10:48,426 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:10:48,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:10:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 05:10:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-21 05:10:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 05:10:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-21 05:10:48,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2022-07-21 05:10:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:10:48,433 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-21 05:10:48,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 05:10:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-21 05:10:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 05:10:48,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:10:48,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:10:48,464 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:10:48,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:10:48,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:10:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:10:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2022-07-21 05:10:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:10:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229017287] [2022-07-21 05:10:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:10:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:10:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:10:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:10:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:10:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 05:10:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:10:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:10:48,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229017287] [2022-07-21 05:10:48,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229017287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:10:48,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472876447] [2022-07-21 05:10:48,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:10:48,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:10:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:10:48,936 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:10:48,940 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:10:49,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:10:49,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:10:49,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 05:10:49,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:10:49,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 05:10:50,216 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-21 05:10:50,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 27 [2022-07-21 05:10:50,406 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-21 05:10:50,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-07-21 05:10:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:10:50,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:10:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472876447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:10:50,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 05:10:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-07-21 05:10:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585166867] [2022-07-21 05:10:50,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 05:10:50,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 05:10:50,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:10:50,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 05:10:50,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-07-21 05:10:50,743 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-21 05:10:52,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:10:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:10:53,796 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-21 05:10:53,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 05:10:53,798 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2022-07-21 05:10:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:10:53,801 INFO L225 Difference]: With dead ends: 99 [2022-07-21 05:10:53,801 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 05:10:53,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 05:10:53,803 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:10:53,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 377 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 363 Invalid, 1 Unknown, 149 Unchecked, 2.5s Time] [2022-07-21 05:10:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 05:10:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-07-21 05:10:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-21 05:10:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-21 05:10:53,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 48 [2022-07-21 05:10:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:10:53,815 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-21 05:10:53,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-21 05:10:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-21 05:10:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 05:10:53,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:10:53,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:10:53,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:10:54,041 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,SelfDestructingSolverStorable3 [2022-07-21 05:10:54,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:10:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:10:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560803, now seen corresponding path program 1 times [2022-07-21 05:10:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:10:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639188580] [2022-07-21 05:10:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:10:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:10:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:10:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:10:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:10:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 05:10:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 05:10:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 05:10:56,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:10:56,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639188580] [2022-07-21 05:10:56,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639188580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:10:56,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202426462] [2022-07-21 05:10:56,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:10:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:10:56,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:10:56,048 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:10:56,052 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:10:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:10:56,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-21 05:10:56,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:10:56,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 05:10:56,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-21 05:10:56,362 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 05:10:56,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 05:10:56,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2022-07-21 05:10:56,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-07-21 05:10:56,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-21 05:11:01,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-07-21 05:11:03,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-21 05:11:04,522 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_181 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181))) |c_#memory_int|)) is different from true [2022-07-21 05:11:04,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-07-21 05:11:10,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-07-21 05:11:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:11:10,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:25,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int)) (or (let ((.cse0 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse1 (= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0))) (and (or (and .cse0 (not .cse1)) (forall ((v_ArrVal_188 Int)) (let ((.cse2 (let ((.cse5 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse5) (select .cse3 .cse4)))) .cse5 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (or (not .cse0) (forall ((v_ArrVal_188 Int)) (let ((.cse6 (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse9) (select .cse7 .cse8)))) .cse9 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) .cse1))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|))) is different from false [2022-07-21 05:11:25,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202426462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:25,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 05:11:25,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-07-21 05:11:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507845445] [2022-07-21 05:11:25,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:25,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 05:11:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:25,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 05:11:25,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2006, Unknown=12, NotChecked=182, Total=2352 [2022-07-21 05:11:25,384 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-21 05:11:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:53,185 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-07-21 05:11:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 05:11:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-21 05:11:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:53,188 INFO L225 Difference]: With dead ends: 91 [2022-07-21 05:11:53,188 INFO L226 Difference]: Without dead ends: 89 [2022-07-21 05:11:53,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=327, Invalid=3688, Unknown=25, NotChecked=250, Total=4290 [2022-07-21 05:11:53,191 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:53,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 491 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 259 Unchecked, 0.5s Time] [2022-07-21 05:11:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-21 05:11:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-21 05:11:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-21 05:11:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-07-21 05:11:53,222 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 53 [2022-07-21 05:11:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:53,222 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-07-21 05:11:53,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-21 05:11:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-07-21 05:11:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 05:11:53,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:53,224 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:53,250 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:11:53,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:53,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 1 times [2022-07-21 05:11:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:53,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835160276] [2022-07-21 05:11:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:11:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:11:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:11:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:11:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 05:11:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 05:11:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835160276] [2022-07-21 05:11:53,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835160276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411187639] [2022-07-21 05:11:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:53,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:53,560 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:11:53,561 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:11:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:53,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 05:11:53,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 05:11:53,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 05:11:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411187639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:11:53,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:11:53,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-21 05:11:53,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274527573] [2022-07-21 05:11:53,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:53,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 05:11:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 05:11:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-21 05:11:53,872 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 05:11:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:54,102 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2022-07-21 05:11:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:11:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2022-07-21 05:11:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:54,104 INFO L225 Difference]: With dead ends: 115 [2022-07-21 05:11:54,104 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 05:11:54,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:11:54,105 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:54,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 05:11:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-21 05:11:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-21 05:11:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2022-07-21 05:11:54,120 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 54 [2022-07-21 05:11:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:54,121 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2022-07-21 05:11:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 05:11:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-07-21 05:11:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:11:54,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:54,123 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:54,142 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:11:54,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:54,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 2 times [2022-07-21 05:11:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:54,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55303136] [2022-07-21 05:11:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:11:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:11:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:11:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 05:11:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 05:11:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:11:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:54,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55303136] [2022-07-21 05:11:54,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55303136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:54,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486722172] [2022-07-21 05:11:54,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:11:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:54,457 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:11:54,484 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:11:54,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:11:54,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:11:54,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:11:54,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 05:11:54,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 05:11:54,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486722172] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:11:54,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:11:54,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-07-21 05:11:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676151327] [2022-07-21 05:11:54,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:54,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 05:11:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 05:11:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:11:54,718 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:11:56,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:11:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:57,152 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-07-21 05:11:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 05:11:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-07-21 05:11:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:57,154 INFO L225 Difference]: With dead ends: 127 [2022-07-21 05:11:57,154 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 05:11:57,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:11:57,156 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:57,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 421 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 05:11:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 05:11:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-21 05:11:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-21 05:11:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-21 05:11:57,177 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 57 [2022-07-21 05:11:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:57,177 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-21 05:11:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:11:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-21 05:11:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 05:11:57,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:57,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:57,196 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:11:57,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:57,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2022-07-21 05:11:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:57,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429162673] [2022-07-21 05:11:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:11:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:11:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:11:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 05:11:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 05:11:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:11:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 05:11:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429162673] [2022-07-21 05:11:57,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429162673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607698279] [2022-07-21 05:11:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:57,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:57,532 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:11:57,567 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:11:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:57,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 05:11:57,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 05:11:57,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 05:11:58,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607698279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:11:58,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:11:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-21 05:11:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622666688] [2022-07-21 05:11:58,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:11:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:11:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:11:58,248 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 05:11:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:58,742 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-21 05:11:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 05:11:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 59 [2022-07-21 05:11:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:58,745 INFO L225 Difference]: With dead ends: 106 [2022-07-21 05:11:58,745 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 05:11:58,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-07-21 05:11:58,747 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:58,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:11:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 05:11:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-21 05:11:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-21 05:11:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-21 05:11:58,776 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 59 [2022-07-21 05:11:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:58,776 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-21 05:11:58,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 05:11:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-21 05:11:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 05:11:58,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:58,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:58,794 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:11:58,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:58,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2022-07-21 05:11:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:58,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233448672] [2022-07-21 05:11:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:11:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:11:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:11:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 05:11:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:11:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:11:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 05:11:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:59,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233448672] [2022-07-21 05:11:59,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233448672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:59,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282836178] [2022-07-21 05:11:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:59,140 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:11:59,168 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:11:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:59,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 05:11:59,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 05:11:59,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 05:11:59,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282836178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:11:59,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:11:59,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-21 05:11:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438785691] [2022-07-21 05:11:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:59,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:11:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:11:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:11:59,810 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-21 05:11:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:59,988 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-21 05:11:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:11:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2022-07-21 05:11:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:59,989 INFO L225 Difference]: With dead ends: 103 [2022-07-21 05:11:59,989 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 05:11:59,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:11:59,991 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:59,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 05:12:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-07-21 05:12:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-21 05:12:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-21 05:12:00,001 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 65 [2022-07-21 05:12:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:12:00,001 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-21 05:12:00,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-21 05:12:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-21 05:12:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 05:12:00,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:12:00,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:12:00,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 05:12:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:12:00,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:12:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:12:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash -838921823, now seen corresponding path program 1 times [2022-07-21 05:12:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:12:00,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900383238] [2022-07-21 05:12:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:12:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:12:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:12:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:12:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:12:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:12:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:12:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:12:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:12:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 05:12:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 05:12:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:12:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900383238] [2022-07-21 05:12:00,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900383238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:12:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499128521] [2022-07-21 05:12:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:12:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:12:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:12:00,344 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:12:00,372 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:12:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 05:12:00,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:12:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 05:12:00,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:12:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 05:12:00,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499128521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:12:00,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:12:00,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-21 05:12:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833664710] [2022-07-21 05:12:00,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:12:00,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:12:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:12:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:12:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:12:00,676 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 05:12:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:12:00,831 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-21 05:12:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:12:00,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-21 05:12:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:12:00,832 INFO L225 Difference]: With dead ends: 67 [2022-07-21 05:12:00,832 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 05:12:00,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-21 05:12:00,833 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:12:00,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:12:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 05:12:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-21 05:12:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 05:12:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-07-21 05:12:00,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 66 [2022-07-21 05:12:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:12:00,841 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-07-21 05:12:00,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 05:12:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-07-21 05:12:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 05:12:00,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:12:00,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:12:00,865 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:12:01,051 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,SelfDestructingSolverStorable9 [2022-07-21 05:12:01,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:12:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:12:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2022-07-21 05:12:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:12:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137996984] [2022-07-21 05:12:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:12:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:12:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:12:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:12:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:12:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:12:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:12:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:12:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:12:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 05:12:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:12:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:12:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 05:12:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:12:01,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137996984] [2022-07-21 05:12:01,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137996984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:12:01,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063821935] [2022-07-21 05:12:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:12:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:12:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:12:01,327 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:12:01,328 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:12:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:12:01,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-21 05:12:01,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:12:01,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 05:12:01,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-21 05:12:01,594 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 05:12:01,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 05:12:01,629 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_545 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_545) |c_#memory_int|)) is different from true [2022-07-21 05:12:01,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:12:01,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:12:01,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:12:01,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:12:05,991 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_552 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_552)))) is different from true [2022-07-21 05:12:16,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-21 05:12:16,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2022-07-21 05:12:21,167 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-07-21 05:12:26,281 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-07-21 05:12:30,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 143 [2022-07-21 05:12:39,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2022-07-21 05:12:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-07-21 05:12:39,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:12:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063821935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:12:43,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 05:12:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36] total 47 [2022-07-21 05:12:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910407747] [2022-07-21 05:12:43,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 05:12:43,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-21 05:12:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:12:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-21 05:12:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1926, Unknown=20, NotChecked=364, Total=2450 [2022-07-21 05:12:43,072 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-21 05:12:45,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:13:00,505 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|)))) is different from true [2022-07-21 05:13:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:00,532 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2022-07-21 05:13:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 05:13:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 72 [2022-07-21 05:13:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:00,534 INFO L225 Difference]: With dead ends: 125 [2022-07-21 05:13:00,534 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 05:13:00,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 54.3s TimeCoverageRelationStatistics Valid=394, Invalid=5148, Unknown=28, NotChecked=750, Total=6320 [2022-07-21 05:13:00,536 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1016 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:00,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 470 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 828 Invalid, 1 Unknown, 1016 Unchecked, 2.7s Time] [2022-07-21 05:13:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 05:13:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-07-21 05:13:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2022-07-21 05:13:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-07-21 05:13:00,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2022-07-21 05:13:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:00,549 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-07-21 05:13:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-21 05:13:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-07-21 05:13:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 05:13:00,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:00,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:00,569 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:13:00,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:13:00,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2022-07-21 05:13:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:00,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233923099] [2022-07-21 05:13:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 05:13:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:13:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:13:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:13:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:13:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:13:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:13:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 05:13:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:00,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233923099] [2022-07-21 05:13:00,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233923099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:13:00,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949585383] [2022-07-21 05:13:00,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:13:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:13:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:13:00,988 INFO L229 MonitoredProcess]: Starting monitored process 11 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:13:00,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 05:13:01,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:13:01,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:13:01,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 172 conjunts are in the unsatisfiable core [2022-07-21 05:13:01,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:13:01,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 05:13:01,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-21 05:13:01,233 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 05:13:01,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 05:13:01,259 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_683 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_683) |c_#memory_int|)) is different from true [2022-07-21 05:13:01,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:13:01,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:13:01,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:13:01,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:13:01,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 05:13:02,338 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|)) is different from true [2022-07-21 05:13:04,876 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) is different from true [2022-07-21 05:13:09,670 WARN L855 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_693 Int) (v_ArrVal_688 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_688) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_693)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2022-07-21 05:13:09,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-07-21 05:13:11,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2022-07-21 05:13:17,285 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|)) is different from true [2022-07-21 05:13:20,436 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2022-07-21 05:13:22,573 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (let ((.cse0 (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2))) (or (and (< |c_downsweep_#in~right| |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (not (= (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2) 0))) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)))) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse1 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse1 .cse2 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse1 .cse2))) .cse2 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|))) is different from true [2022-07-21 05:13:22,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-07-21 05:13:31,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2022-07-21 05:13:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 17 not checked. [2022-07-21 05:13:31,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:13:33,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949585383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:13:33,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 05:13:33,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-07-21 05:13:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666244009] [2022-07-21 05:13:33,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 05:13:33,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 05:13:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 05:13:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1223, Unknown=22, NotChecked=532, Total=1892 [2022-07-21 05:13:33,835 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-21 05:13:35,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:13:46,506 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|))) is different from true [2022-07-21 05:13:53,400 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|))) is different from true [2022-07-21 05:13:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:13:53,426 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2022-07-21 05:13:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-21 05:13:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) Word has length 74 [2022-07-21 05:13:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:13:53,428 INFO L225 Difference]: With dead ends: 137 [2022-07-21 05:13:53,428 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 05:13:53,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=461, Invalid=4099, Unknown=32, NotChecked=1260, Total=5852 [2022-07-21 05:13:53,431 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1237 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:13:53,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 385 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 551 Invalid, 1 Unknown, 1237 Unchecked, 2.5s Time] [2022-07-21 05:13:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 05:13:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-07-21 05:13:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-21 05:13:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2022-07-21 05:13:53,443 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 74 [2022-07-21 05:13:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:13:53,444 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2022-07-21 05:13:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-21 05:13:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2022-07-21 05:13:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 05:13:53,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:13:53,446 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:13:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 05:13:53,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 05:13:53,656 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:13:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:13:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 1 times [2022-07-21 05:13:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:13:53,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989619537] [2022-07-21 05:13:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:13:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:13:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:13:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:13:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:13:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:13:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:13:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:13:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:13:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:13:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 05:13:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:13:53,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989619537] [2022-07-21 05:13:53,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989619537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:13:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172266188] [2022-07-21 05:13:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:13:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:13:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:13:53,992 INFO L229 MonitoredProcess]: Starting monitored process 12 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:13:53,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 05:13:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:13:54,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 05:13:54,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:13:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-21 05:13:54,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:13:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-21 05:13:55,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172266188] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:13:55,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:13:55,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 12] total 33 [2022-07-21 05:13:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775897021] [2022-07-21 05:13:55,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:13:55,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 05:13:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:13:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 05:13:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 05:13:55,335 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-21 05:13:57,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:13:59,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 05:14:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:00,724 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2022-07-21 05:14:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 05:14:00,724 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) Word has length 85 [2022-07-21 05:14:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:00,725 INFO L225 Difference]: With dead ends: 157 [2022-07-21 05:14:00,725 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 05:14:00,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=2436, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 05:14:00,727 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 101 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:00,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 988 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-07-21 05:14:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 05:14:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2022-07-21 05:14:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (29), 19 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-21 05:14:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2022-07-21 05:14:00,746 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 85 [2022-07-21 05:14:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:00,747 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2022-07-21 05:14:00,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-21 05:14:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2022-07-21 05:14:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 05:14:00,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:00,748 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:00,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:00,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 05:14:00,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1782863912, now seen corresponding path program 2 times [2022-07-21 05:14:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:00,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781141707] [2022-07-21 05:14:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:14:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:14:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:14:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:14:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:14:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 05:14:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:14:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:14:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:14:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:14:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781141707] [2022-07-21 05:14:01,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781141707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644771278] [2022-07-21 05:14:01,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:14:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:01,170 INFO L229 MonitoredProcess]: Starting monitored process 13 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:14:01,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 05:14:01,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:14:01,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:14:01,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:14:01,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:14:01,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:14:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:14:01,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644771278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:14:01,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:14:01,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-07-21 05:14:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035844451] [2022-07-21 05:14:01,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:14:01,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 05:14:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 05:14:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:14:01,815 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 05:14:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:02,051 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-07-21 05:14:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 05:14:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-21 05:14:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:02,053 INFO L225 Difference]: With dead ends: 116 [2022-07-21 05:14:02,053 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 05:14:02,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:14:02,054 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:02,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:14:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 05:14:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-21 05:14:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1) internal successors, (77), 69 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (27), 19 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-21 05:14:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-21 05:14:02,076 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 97 [2022-07-21 05:14:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:02,078 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-21 05:14:02,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 05:14:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-21 05:14:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 05:14:02,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:02,080 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:02,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:02,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 05:14:02,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1157064136, now seen corresponding path program 3 times [2022-07-21 05:14:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:02,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621769505] [2022-07-21 05:14:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 05:14:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 05:14:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:14:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:14:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 05:14:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 05:14:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:14:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:14:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 05:14:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-21 05:14:02,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:02,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621769505] [2022-07-21 05:14:02,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621769505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:02,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608639810] [2022-07-21 05:14:02,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:14:02,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:02,518 INFO L229 MonitoredProcess]: Starting monitored process 14 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:14:02,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 05:14:02,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 05:14:02,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:14:02,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-21 05:14:02,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:35,132 WARN L233 SmtUtils]: Spent 12.93s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 05:14:55,624 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)