./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 b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-b5317da-m [2023-02-16 03:00:29,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:00:29,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:00:29,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:00:29,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:00:29,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:00:29,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:00:29,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:00:29,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:00:29,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:00:29,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:00:29,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:00:29,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:00:29,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:00:29,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:00:29,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:00:29,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:00:29,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:00:29,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:00:29,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:00:29,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:00:29,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:00:29,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:00:29,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:00:29,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:00:29,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:00:29,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:00:29,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:00:29,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:00:29,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:00:29,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:00:29,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:00:29,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:00:29,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:00:29,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:00:29,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:00:29,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:00:29,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:00:29,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:00:29,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:00:29,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:00:29,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 03:00:29,698 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:00:29,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:00:29,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:00:29,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:00:29,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:00:29,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:00:29,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:00:29,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:00:29,701 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:00:29,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:00:29,702 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:00:29,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:00:29,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:00:29,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:00:29,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:00:29,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 03:00:29,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:00:29,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:00:29,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:00:29,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:00:29,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:00:29,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:00:29,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 03:00:29,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:00:29,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:00:29,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:00:29,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 03:00:29,706 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:00:29,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:00:29,706 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:00:29,706 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2023-02-16 03:00:29,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:00:29,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:00:29,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:00:29,907 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:00:29,907 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:00:29,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-16 03:00:31,064 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:00:31,216 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:00:31,216 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-16 03:00:31,220 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a08b54bf/2809b249e9184a51bdf288f8b0962013/FLAG3a1fced6a [2023-02-16 03:00:31,232 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a08b54bf/2809b249e9184a51bdf288f8b0962013 [2023-02-16 03:00:31,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:00:31,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:00:31,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:00:31,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:00:31,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:00:31,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375ac436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31, skipping insertion in model container [2023-02-16 03:00:31,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:00:31,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:00:31,344 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-16 03:00:31,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:00:31,367 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:00:31,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-16 03:00:31,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:00:31,400 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:00:31,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31 WrapperNode [2023-02-16 03:00:31,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:00:31,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:00:31,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:00:31,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:00:31,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,427 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2023-02-16 03:00:31,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:00:31,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:00:31,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:00:31,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:00:31,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:00:31,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:00:31,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:00:31,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:00:31,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (1/1) ... [2023-02-16 03:00:31,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:00:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:31,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:00:31,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:00:31,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:00:31,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 03:00:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 03:00:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:00:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2023-02-16 03:00:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2023-02-16 03:00:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:00:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:00:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2023-02-16 03:00:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2023-02-16 03:00:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:00:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:00:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:00:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-16 03:00:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-16 03:00:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:00:31,586 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:00:31,587 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:00:31,782 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:00:31,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:00:31,787 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 03:00:31,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:00:31 BoogieIcfgContainer [2023-02-16 03:00:31,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:00:31,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:00:31,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:00:31,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:00:31,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:00:31" (1/3) ... [2023-02-16 03:00:31,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15de7466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:00:31, skipping insertion in model container [2023-02-16 03:00:31,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:00:31" (2/3) ... [2023-02-16 03:00:31,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15de7466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:00:31, skipping insertion in model container [2023-02-16 03:00:31,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:00:31" (3/3) ... [2023-02-16 03:00:31,802 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2023-02-16 03:00:31,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:00:31,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 03:00:31,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:00:31,849 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4269a1e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:00:31,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 03:00:31,852 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) [2023-02-16 03:00:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:00:31,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:31,858 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] [2023-02-16 03:00:31,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2023-02-16 03:00:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:31,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408984426] [2023-02-16 03:00:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 03:00:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-16 03:00:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:00:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:32,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408984426] [2023-02-16 03:00:32,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408984426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:00:32,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:00:32,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:00:32,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341916409] [2023-02-16 03:00:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:00:32,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:00:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:00:32,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:00:32,072 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) [2023-02-16 03:00:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:32,126 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-02-16 03:00:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:00:32,128 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 [2023-02-16 03:00:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:32,132 INFO L225 Difference]: With dead ends: 96 [2023-02-16 03:00:32,133 INFO L226 Difference]: Without dead ends: 46 [2023-02-16 03:00:32,135 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 [2023-02-16 03:00:32,137 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:32,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:00:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-16 03:00:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-16 03:00:32,160 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) [2023-02-16 03:00:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2023-02-16 03:00:32,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2023-02-16 03:00:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-02-16 03:00:32,163 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) [2023-02-16 03:00:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2023-02-16 03:00:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:00:32,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:32,165 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] [2023-02-16 03:00:32,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:00:32,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:32,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2023-02-16 03:00:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:32,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326122112] [2023-02-16 03:00:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 03:00:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-16 03:00:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:00:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326122112] [2023-02-16 03:00:32,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326122112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:00:32,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:00:32,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:00:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887650566] [2023-02-16 03:00:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:00:32,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:00:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:00:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:00:32,603 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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) [2023-02-16 03:00:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:32,773 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2023-02-16 03:00:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:00:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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 [2023-02-16 03:00:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:32,779 INFO L225 Difference]: With dead ends: 59 [2023-02-16 03:00:32,779 INFO L226 Difference]: Without dead ends: 48 [2023-02-16 03:00:32,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:00:32,781 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:32,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 185 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-16 03:00:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-02-16 03:00:32,788 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) [2023-02-16 03:00:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-02-16 03:00:32,789 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2023-02-16 03:00:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:32,793 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-02-16 03:00:32,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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) [2023-02-16 03:00:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-02-16 03:00:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:00:32,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:32,799 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] [2023-02-16 03:00:32,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:00:32,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2023-02-16 03:00:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:32,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126055008] [2023-02-16 03:00:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-16 03:00:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 03:00:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:00:33,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:33,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126055008] [2023-02-16 03:00:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126055008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428219279] [2023-02-16 03:00:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:33,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:00:33,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:00:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:33,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:00:33,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:00:33,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:00:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428219279] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:00:33,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:00:33,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-16 03:00:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002294063] [2023-02-16 03:00:33,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:33,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:00:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:00:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:00:33,548 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) [2023-02-16 03:00:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:33,670 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2023-02-16 03:00:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:00:33,671 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 [2023-02-16 03:00:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:33,672 INFO L225 Difference]: With dead ends: 73 [2023-02-16 03:00:33,672 INFO L226 Difference]: Without dead ends: 50 [2023-02-16 03:00:33,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:00:33,673 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:33,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-16 03:00:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-02-16 03:00:33,678 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) [2023-02-16 03:00:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-02-16 03:00:33,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2023-02-16 03:00:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:33,680 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-02-16 03:00:33,680 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) [2023-02-16 03:00:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-02-16 03:00:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:00:33,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:33,681 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] [2023-02-16 03:00:33,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:33,886 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 [2023-02-16 03:00:33,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2023-02-16 03:00:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018582857] [2023-02-16 03:00:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:00:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-16 03:00:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:00:35,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:35,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018582857] [2023-02-16 03:00:35,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018582857] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:35,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293529276] [2023-02-16 03:00:35,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:00:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:35,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:00:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 03:00:35,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:00:35,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:00:35,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-16 03:00:35,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:35,850 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:35,895 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_123 Int)) (= |c_#memory_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_123) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) (select .cse0 .cse1)))))) is different from true [2023-02-16 03:00:35,915 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-02-16 03:00:35,915 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:36,026 INFO L321 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-02-16 03:00:36,027 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 23 [2023-02-16 03:00:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:00:36,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:36,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293529276] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:36,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:00:36,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 31 [2023-02-16 03:00:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778061518] [2023-02-16 03:00:36,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:36,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:00:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:00:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=952, Unknown=1, NotChecked=62, Total=1122 [2023-02-16 03:00:36,277 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 03:00:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:38,485 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-02-16 03:00:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 03:00:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 48 [2023-02-16 03:00:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:38,488 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:00:38,488 INFO L226 Difference]: Without dead ends: 76 [2023-02-16 03:00:38,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=332, Invalid=2427, Unknown=1, NotChecked=102, Total=2862 [2023-02-16 03:00:38,490 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 182 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:38,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 316 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 802 Invalid, 0 Unknown, 74 Unchecked, 0.6s Time] [2023-02-16 03:00:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-16 03:00:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2023-02-16 03:00:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-16 03:00:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2023-02-16 03:00:38,499 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 48 [2023-02-16 03:00:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:38,499 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2023-02-16 03:00:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 03:00:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2023-02-16 03:00:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 03:00:38,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:38,500 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] [2023-02-16 03:00:38,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:38,705 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 [2023-02-16 03:00:38,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 736701521, now seen corresponding path program 1 times [2023-02-16 03:00:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:38,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475988170] [2023-02-16 03:00:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:00:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-16 03:00:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 03:00:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475988170] [2023-02-16 03:00:39,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475988170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:39,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259408629] [2023-02-16 03:00:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:39,020 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) [2023-02-16 03:00:39,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 03:00:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:39,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-16 03:00:39,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:39,110 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:39,135 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:39,181 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:00:39,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:39,202 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_172 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_172))) is different from true [2023-02-16 03:00:39,207 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:39,265 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-16 03:00:39,269 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 19 [2023-02-16 03:00:39,326 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:39,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 42 [2023-02-16 03:00:39,497 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1)))))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2023-02-16 03:00:39,529 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 56 [2023-02-16 03:00:39,578 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 43 [2023-02-16 03:00:39,613 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_181 Int)) (and (= |c_#memory_int| (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_181)))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-16 03:00:39,633 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 65 [2023-02-16 03:00:39,999 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 91 [2023-02-16 03:00:40,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:00:40,006 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 117 [2023-02-16 03:00:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-02-16 03:00:40,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:47,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259408629] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:47,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:00:47,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 31 [2023-02-16 03:00:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918314201] [2023-02-16 03:00:47,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:00:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:00:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1088, Unknown=4, NotChecked=204, Total=1406 [2023-02-16 03:00:47,005 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-16 03:00:48,911 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1)))))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))) is different from true [2023-02-16 03:00:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:49,277 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2023-02-16 03:00:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-16 03:00:49,277 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Word has length 52 [2023-02-16 03:00:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:49,278 INFO L225 Difference]: With dead ends: 136 [2023-02-16 03:00:49,278 INFO L226 Difference]: Without dead ends: 103 [2023-02-16 03:00:49,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=527, Invalid=3905, Unknown=6, NotChecked=532, Total=4970 [2023-02-16 03:00:49,280 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 116 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:49,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 217 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 797 Invalid, 0 Unknown, 350 Unchecked, 0.6s Time] [2023-02-16 03:00:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-16 03:00:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-16 03:00:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (25), 17 states have call predecessors, (25), 16 states have call successors, (25) [2023-02-16 03:00:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-02-16 03:00:49,324 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 52 [2023-02-16 03:00:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:49,326 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-02-16 03:00:49,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-16 03:00:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-02-16 03:00:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 03:00:49,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:49,330 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] [2023-02-16 03:00:49,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:49,534 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 [2023-02-16 03:00:49,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 2 times [2023-02-16 03:00:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208123789] [2023-02-16 03:00:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-16 03:00:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-16 03:00:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 03:00:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:49,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208123789] [2023-02-16 03:00:49,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208123789] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803008970] [2023-02-16 03:00:49,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:00:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:49,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:49,663 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) [2023-02-16 03:00:49,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:00:49,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:00:49,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:00:49,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:00:49,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 03:00:49,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 03:00:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803008970] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:00:49,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:00:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2023-02-16 03:00:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17120167] [2023-02-16 03:00:49,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:49,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:00:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:00:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:00:49,929 INFO L87 Difference]: Start difference. First operand 82 states and 107 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) [2023-02-16 03:00:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:50,097 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2023-02-16 03:00:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:00:50,098 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 [2023-02-16 03:00:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:50,099 INFO L225 Difference]: With dead ends: 108 [2023-02-16 03:00:50,099 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 03:00:50,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:00:50,100 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:50,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 336 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 03:00:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-16 03:00:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 59 states have internal predecessors, (64), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (22), 15 states have call predecessors, (22), 15 states have call successors, (22) [2023-02-16 03:00:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2023-02-16 03:00:50,118 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 54 [2023-02-16 03:00:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:50,120 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2023-02-16 03:00:50,120 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) [2023-02-16 03:00:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2023-02-16 03:00:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-16 03:00:50,122 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:50,122 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] [2023-02-16 03:00:50,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:50,327 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 [2023-02-16 03:00:50,327 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 1 times [2023-02-16 03:00:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400961902] [2023-02-16 03:00:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 03:00:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 03:00:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 03:00:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-16 03:00:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-16 03:00:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:00:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:50,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400961902] [2023-02-16 03:00:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400961902] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983674036] [2023-02-16 03:00:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:50,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:50,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:50,474 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) [2023-02-16 03:00:50,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:00:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:50,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:00:50,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:00:50,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:00:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983674036] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:00:50,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:00:50,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-02-16 03:00:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909647691] [2023-02-16 03:00:50,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:00:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:50,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:00:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:00:50,682 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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) [2023-02-16 03:00:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:50,816 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2023-02-16 03:00:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:00:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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 [2023-02-16 03:00:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:50,817 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:00:50,817 INFO L226 Difference]: Without dead ends: 86 [2023-02-16 03:00:50,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:00:50,818 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:50,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 279 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-16 03:00:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-16 03:00:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:00:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2023-02-16 03:00:50,834 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 57 [2023-02-16 03:00:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:50,835 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2023-02-16 03:00:50,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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) [2023-02-16 03:00:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2023-02-16 03:00:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:00:50,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:50,835 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] [2023-02-16 03:00:50,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:51,042 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 [2023-02-16 03:00:51,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2023-02-16 03:00:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827864092] [2023-02-16 03:00:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 03:00:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 03:00:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 03:00:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-16 03:00:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-16 03:00:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:00:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:00:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:51,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827864092] [2023-02-16 03:00:51,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827864092] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:51,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334480750] [2023-02-16 03:00:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:51,192 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) [2023-02-16 03:00:51,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 03:00:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:51,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:00:51,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:00:51,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:00:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334480750] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:00:51,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:00:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-02-16 03:00:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750942235] [2023-02-16 03:00:51,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:51,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 03:00:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 03:00:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:00:51,742 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-16 03:00:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:51,906 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-02-16 03:00:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:00:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 59 [2023-02-16 03:00:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:51,908 INFO L225 Difference]: With dead ends: 90 [2023-02-16 03:00:51,908 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:00:51,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:00:51,908 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:51,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 204 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:00:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-16 03:00:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 15 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-16 03:00:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2023-02-16 03:00:51,923 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 59 [2023-02-16 03:00:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:51,924 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2023-02-16 03:00:51,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-16 03:00:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2023-02-16 03:00:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-16 03:00:51,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:51,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-02-16 03:00:51,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:52,129 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 [2023-02-16 03:00:52,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash -94562582, now seen corresponding path program 1 times [2023-02-16 03:00:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:52,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132314719] [2023-02-16 03:00:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-16 03:00:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:00:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-16 03:00:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 03:00:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132314719] [2023-02-16 03:00:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132314719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816677739] [2023-02-16 03:00:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:52,313 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) [2023-02-16 03:00:52,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 03:00:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:52,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:00:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 03:00:52,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:00:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 03:00:52,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816677739] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:00:52,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:00:52,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-02-16 03:00:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438799241] [2023-02-16 03:00:52,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:00:52,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:00:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:00:52,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:00:52,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:00:52,847 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-16 03:00:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:00:53,012 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2023-02-16 03:00:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:00:53,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 62 [2023-02-16 03:00:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:00:53,015 INFO L225 Difference]: With dead ends: 93 [2023-02-16 03:00:53,015 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:00:53,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:00:53,017 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:00:53,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 187 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:00:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:00:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-16 03:00:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 59 states have internal predecessors, (65), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2023-02-16 03:00:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2023-02-16 03:00:53,032 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 62 [2023-02-16 03:00:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:00:53,032 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2023-02-16 03:00:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-16 03:00:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2023-02-16 03:00:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-16 03:00:53,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:00:53,034 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] [2023-02-16 03:00:53,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:00:53,240 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 [2023-02-16 03:00:53,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:00:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:00:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2023-02-16 03:00:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:00:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961490531] [2023-02-16 03:00:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:00:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:00:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:00:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:00:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-16 03:00:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:00:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-16 03:00:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:00:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:00:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-16 03:00:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:00:53,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961490531] [2023-02-16 03:00:53,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961490531] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:00:53,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392479115] [2023-02-16 03:00:53,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:00:53,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:00:53,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:00:53,594 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) [2023-02-16 03:00:53,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 03:00:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:00:53,701 WARN L261 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 179 conjunts are in the unsatisfiable core [2023-02-16 03:00:53,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:00:53,761 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,790 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,841 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:00:53,841 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,864 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_488 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_488))) is different from true [2023-02-16 03:00:53,867 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,894 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,923 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:53,952 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:00:54,133 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_493 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~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_493)))) is different from true [2023-02-16 03:00:54,189 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_494 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~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_494)))) is different from true [2023-02-16 03:00:54,247 WARN L859 $PredicateComparison]: unable to prove that (and (< (+ |c_upsweep_#in~left| 1) |c_upsweep_#in~right|) (exists ((v_ArrVal_496 Int) (v_ArrVal_493 Int)) (= |c_#memory_int| (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| (* |c_upsweep_#in~left| 4)) v_ArrVal_493) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_496))))) is different from true [2023-02-16 03:00:54,257 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 25 [2023-02-16 03:00:54,307 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 36 [2023-02-16 03:00:54,501 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_503 Int)) (and (= |c_#memory_int| (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_503)))) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2023-02-16 03:00:54,777 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_507 Int) (downsweep_~right Int) (v_ArrVal_506 Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (= |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|) (+ (* downsweep_~right 4) downsweep_~a.offset) v_ArrVal_507) (+ (* downsweep_~left 4) downsweep_~a.offset) v_ArrVal_506))) (<= |c_downsweep_#in~right| downsweep_~right) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2023-02-16 03:00:55,076 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse6 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse0 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse3 (select .cse5 .cse6)) (.cse10 (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))) (.cse9 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse4 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse1 (store .cse5 .cse6 v_ArrVal_501))) (store .cse1 .cse2 (+ .cse3 (select (store .cse1 .cse2 .cse3) .cse4)))) .cse4 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (and (exists ((v_downsweep_~left_41 Int) (downsweep_~left Int) (v_downsweep_~right_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_downsweep_~a.offset_41 Int) (v_ArrVal_501 Int)) (and (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (<= (+ .cse0 v_downsweep_~left_41) |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse8 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse7 (store .cse5 .cse6 v_ArrVal_501))) (store .cse7 .cse2 (+ .cse3 (select (store .cse7 .cse2 .cse3) .cse8)))) .cse8 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))) (<= |c_downsweep_#in~right| v_downsweep_~right_41) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))) (or (not .cse9) .cse10)) (and (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse12 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse11 (store .cse5 .cse6 v_ArrVal_501))) (store .cse11 .cse2 (+ .cse3 (select (store .cse11 .cse2 .cse3) .cse12)))) .cse12 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (not .cse10) .cse9)))) is different from true [2023-02-16 03:00:55,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 438 [2023-02-16 03:00:57,368 INFO L350 Elim1Store]: Elim1 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 205 treesize of output 199 [2023-02-16 03:01:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 16 not checked. [2023-02-16 03:01:15,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:01:18,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (div |c_ULTIMATE.start_main_~n~0#1| 2)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~n~0#1| 4) (- 4)))) (let ((.cse1 (= 0 (mod |c_ULTIMATE.start_main_~n~0#1| 2))) (.cse0 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse6 (select .cse8 .cse9)) (.cse15 (- .cse2)) (.cse16 (* .cse2 4))) (and (or (not .cse0) .cse1 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)) (.cse3 (div (+ .cse15 |c_ULTIMATE.start_main_~n~0#1| (- 1)) 2)) (.cse12 (= 0 (mod (+ .cse2 |c_ULTIMATE.start_main_~n~0#1| 1) 2)))) (and (forall ((v_downsweep_~right_55 Int)) (or (forall ((v_downsweep_~a.offset_56 Int)) (or (forall ((v_downsweep_~left_57 Int)) (or (< .cse2 (+ .cse3 v_downsweep_~left_57 1)) (not (<= .cse2 (+ v_downsweep_~left_57 1))) (forall ((v_ArrVal_533 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~left_56 Int) (v_ArrVal_534 Int)) (or (< (+ .cse3 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (= 0 (select (store (store (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse4 (store .cse8 .cse9 v_ArrVal_531))) (store .cse4 .cse5 (+ .cse6 (select (store .cse4 .cse5 .cse6) .cse7)))) .cse7 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (not (<= .cse2 (+ v_downsweep_~left_57 1))) (< (+ .cse3 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse10 (store .cse8 .cse9 v_ArrVal_531))) (store .cse10 .cse5 (+ .cse6 (select (store .cse10 .cse5 .cse6) .cse11)))) .cse11 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< .cse2 (+ .cse3 v_downsweep_~left_57)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))) (not .cse12)) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< .cse2 (+ .cse3 v_downsweep_~left_57 1)) (not (<= .cse2 (+ v_downsweep_~left_57 1))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse13 (store .cse8 .cse9 v_ArrVal_531))) (store .cse13 .cse5 (+ .cse6 (select (store .cse13 .cse5 .cse6) .cse14)))) .cse14 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ .cse3 v_downsweep_~left_56 2) |c_ULTIMATE.start_main_~n~0#1|))) .cse12)))) (or (and (not .cse1) .cse0) (let ((.cse17 (= 0 (mod (+ .cse2 |c_ULTIMATE.start_main_~n~0#1|) 2))) (.cse18 (< |c_ULTIMATE.start_main_~n~0#1| .cse2)) (.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16 (- 4))) (.cse19 (div (+ .cse15 |c_ULTIMATE.start_main_~n~0#1|) 2))) (and (or .cse17 (not .cse18) (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< (+ .cse19 v_downsweep_~left_56 2) |c_ULTIMATE.start_main_~n~0#1|) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse22 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse20 (store .cse8 .cse9 v_ArrVal_531))) (store .cse20 .cse21 (+ (select (store .cse20 .cse21 .cse6) .cse22) .cse6))) .cse22 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (not (<= .cse2 (+ v_downsweep_~left_57 2))) (< .cse2 (+ .cse19 v_downsweep_~left_57 2))))) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< .cse2 (+ .cse19 v_downsweep_~left_57 1)) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse23 (store .cse8 .cse9 v_ArrVal_531))) (store .cse23 .cse21 (+ (select (store .cse23 .cse21 .cse6) .cse24) .cse6))) .cse24 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ .cse19 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (not (<= .cse2 (+ v_downsweep_~left_57 2))))) (and (not .cse17) .cse18)) (forall ((v_downsweep_~right_55 Int)) (or (forall ((v_downsweep_~a.offset_56 Int)) (or (forall ((v_downsweep_~left_57 Int)) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~left_56 Int) (v_ArrVal_534 Int)) (or (= 0 (select (store (store (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse25 (store .cse8 .cse9 v_ArrVal_531))) (store .cse25 .cse21 (+ (select (store .cse25 .cse21 .cse6) .cse26) .cse6))) .cse26 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ .cse19 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|))) (not (<= .cse2 (+ v_downsweep_~left_57 2))) (< .cse2 (+ .cse19 v_downsweep_~left_57 2)))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))))))))) is different from false [2023-02-16 03:01:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392479115] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:01:18,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:01:18,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 39] total 49 [2023-02-16 03:01:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545900349] [2023-02-16 03:01:18,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:01:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 03:01:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:01:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 03:01:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1857, Unknown=9, NotChecked=744, Total=2756 [2023-02-16 03:01:18,852 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-16 03:01:23,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:01:29,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:01:31,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:01:32,298 WARN L859 $PredicateComparison]: unable to prove that (and (= c_downsweep_~right (+ |c_downsweep_#in~left| c_downsweep_~space~1)) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2|) 1)) (= c_downsweep_~a.offset |c_downsweep_#in~a.offset|) (let ((.cse9 (* c_downsweep_~right 4))) (let ((.cse5 (select |c_old(#memory_int)| c_downsweep_~a.base)) (.cse6 (+ c_downsweep_~a.offset .cse9))) (let ((.cse0 (div c_downsweep_~space~1 2)) (.cse2 (+ (* c_downsweep_~space~1 (- 4)) c_downsweep_~a.offset .cse9)) (.cse3 (select .cse5 .cse6))) (or (exists ((v_downsweep_~left_41 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 c_downsweep_~space~1 1) c_downsweep_~right) (not (< (+ v_downsweep_~left_41 c_downsweep_~space~1 1) c_downsweep_~right)) (= |c_#memory_int| (store |c_old(#memory_int)| c_downsweep_~a.base (let ((.cse4 (+ (* v_downsweep_~left_41 4) c_downsweep_~a.offset))) (store (let ((.cse1 (store .cse5 .cse6 v_ArrVal_501))) (store .cse1 .cse2 (+ (select (store .cse1 .cse2 .cse3) .cse4) .cse3))) .cse4 v_ArrVal_503)))))) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 c_downsweep_~space~1) c_downsweep_~right) (not (< (+ v_downsweep_~left_41 c_downsweep_~space~1 1) c_downsweep_~right)) (= |c_#memory_int| (store |c_old(#memory_int)| c_downsweep_~a.base (let ((.cse8 (+ (* v_downsweep_~left_41 4) c_downsweep_~a.offset))) (store (let ((.cse7 (store .cse5 .cse6 v_ArrVal_501))) (store .cse7 .cse2 (+ (select (store .cse7 .cse2 .cse3) .cse8) .cse3))) .cse8 v_ArrVal_503)))))) (or (not (< c_downsweep_~space~1 0)) (= 0 (mod c_downsweep_~space~1 2)))))))) (= c_downsweep_~a.base |c_downsweep_#in~a.base|) (= c_downsweep_~right |c_downsweep_#in~right|)) is different from true [2023-02-16 03:01:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:01:37,058 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2023-02-16 03:01:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-16 03:01:37,059 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) Word has length 72 [2023-02-16 03:01:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:01:37,062 INFO L225 Difference]: With dead ends: 152 [2023-02-16 03:01:37,062 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:01:37,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=813, Invalid=8293, Unknown=50, NotChecked=1764, Total=10920 [2023-02-16 03:01:37,064 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 267 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 147 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 940 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:01:37,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 481 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2046 Invalid, 12 Unknown, 940 Unchecked, 10.9s Time] [2023-02-16 03:01:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:01:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2023-02-16 03:01:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 75 states have internal predecessors, (82), 21 states have call successors, (21), 5 states have call predecessors, (21), 10 states have return successors, (48), 23 states have call predecessors, (48), 21 states have call successors, (48) [2023-02-16 03:01:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-02-16 03:01:37,080 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 72 [2023-02-16 03:01:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:01:37,080 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-02-16 03:01:37,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-16 03:01:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-02-16 03:01:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-16 03:01:37,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:01:37,082 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] [2023-02-16 03:01:37,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:01:37,286 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 [2023-02-16 03:01:37,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:01:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:01:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2023-02-16 03:01:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:01:37,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958892141] [2023-02-16 03:01:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:01:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:01:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:01:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 03:01:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 03:01:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 03:01:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 03:01:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:01:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:01:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-16 03:01:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:01:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:01:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:01:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:01:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:01:38,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958892141] [2023-02-16 03:01:38,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958892141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:01:38,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775975309] [2023-02-16 03:01:38,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:01:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:01:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:01:38,926 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) [2023-02-16 03:01:38,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 03:01:39,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:01:39,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:01:39,037 WARN L261 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 186 conjunts are in the unsatisfiable core [2023-02-16 03:01:39,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:01:39,114 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,173 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,260 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:01:39,260 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,301 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_626 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_626))) is different from true [2023-02-16 03:01:39,326 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,381 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,469 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,519 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,569 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:39,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_631 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~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_631)))) is different from true [2023-02-16 03:01:39,772 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_633 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~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_633)))) is different from true [2023-02-16 03:01:39,835 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_631 Int) (upsweep_~right Int) (v_ArrVal_636 Int)) (and (= |c_#memory_int| (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| (* |c_upsweep_#in~left| 4)) v_ArrVal_631) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_636))) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2023-02-16 03:01:39,848 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2023-02-16 03:01:41,059 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:01:41,269 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int)) (and (= |c_#memory_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)))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4))) (.cse2 (select .cse0 .cse1))) (store (store .cse0 .cse1 (+ .cse2 (select .cse0 .cse3))) .cse3 .cse2))))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-16 03:01:41,604 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_647 Int) (v_ArrVal_645 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_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2023-02-16 03:01:42,290 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse5 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse8 (* 3 |c_downsweep_#in~left|)) (.cse11 (+ |c_downsweep_#in~left| |c_downsweep_#in~right|)) (.cse7 (+ |c_downsweep_#in~left| |c_downsweep_#in~right| 1)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse2 (select .cse4 .cse5))) (or (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (let ((.cse6 (* 2 downsweep_~left))) (and (<= (+ (* 2 v_downsweep_~left_58) 1) (* 2 |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse0 (store .cse4 .cse5 v_ArrVal_641))) (store .cse0 .cse1 (+ (select (store .cse0 .cse1 .cse2) .cse3) .cse2))) .cse3 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= (+ (* 4 v_downsweep_~left_58) |c_downsweep_#in~right| 3) (* 5 |c_downsweep_#in~left|)) (<= .cse6 .cse7) (<= .cse6 (* 2 |c_downsweep_#in~right|)) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|))))) (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (and (<= (+ (* 2 v_downsweep_~left_58) |c_downsweep_#in~right| 1) .cse8) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse10 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse9 (store .cse4 .cse5 v_ArrVal_641))) (store .cse9 .cse1 (+ (select (store .cse9 .cse1 .cse2) .cse10) .cse2))) .cse10 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= (+ (* 2 downsweep_~left) 1) .cse11) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (and (<= (* 2 downsweep_~left) .cse11) (<= (+ (* 2 v_downsweep_~left_58) |c_downsweep_#in~right|) .cse8) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse13 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse12 (store .cse4 .cse5 v_ArrVal_641))) (store .cse12 .cse1 (+ (select (store .cse12 .cse1 .cse2) .cse13) .cse2))) .cse13 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (and (<= (* 2 downsweep_~left) .cse11) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse15 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse14 (store .cse4 .cse5 v_ArrVal_641))) (store .cse14 .cse1 (+ (select (store .cse14 .cse1 .cse2) .cse15) .cse2))) .cse15 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= (+ (* 2 v_downsweep_~left_58) |c_downsweep_#in~right| 2) .cse8) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (let ((.cse18 (+ downsweep_~left 1))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse17 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse16 (store .cse4 .cse5 v_ArrVal_641))) (store .cse16 .cse1 (+ (select (store .cse16 .cse1 .cse2) .cse17) .cse2))) .cse17 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= .cse18 |c_downsweep_#in~right|) (<= (+ downsweep_~left (* 4 v_downsweep_~left_58) 1) (+ (* 4 |c_downsweep_#in~left|) |c_downsweep_#in~right|)) (<= (+ (* 2 downsweep_~left) 1) .cse11) (not (< .cse18 |c_downsweep_#in~right|))))) (exists ((v_ArrVal_641 Int) (downsweep_~left Int) (v_downsweep_~left_58 Int) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (and (<= v_downsweep_~left_58 |c_downsweep_#in~left|) (<= downsweep_~left (div .cse7 2)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse20 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_58 4)))) (store (let ((.cse19 (store .cse4 .cse5 v_ArrVal_641))) (store .cse19 .cse1 (+ (select (store .cse19 .cse1 .cse2) .cse20) .cse2))) .cse20 .cse2)) .cse5 v_ArrVal_645) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_647))) (<= downsweep_~left |c_downsweep_#in~right|) (<= (+ (div (+ (* (- 3) |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2) v_downsweep_~left_58) 0) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|))))))) is different from true [2023-02-16 03:01:42,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 802 treesize of output 872 [2023-02-16 03:02:37,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2026 treesize of output 2064 [2023-02-16 03:02:44,423 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 103 [2023-02-16 03:02:44,559 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 103 [2023-02-16 03:02:44,646 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 103 [2023-02-16 03:02:44,697 INFO L350 Elim1Store]: Elim1 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 315 treesize of output 103 [2023-02-16 03:02:46,407 INFO L350 Elim1Store]: Elim1 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 155 treesize of output 149 [2023-02-16 03:02:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 16 not checked. [2023-02-16 03:02:46,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:02:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775975309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:02:47,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:02:47,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 58 [2023-02-16 03:02:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628733997] [2023-02-16 03:02:47,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:02:47,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-16 03:02:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:02:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-16 03:02:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2665, Unknown=16, NotChecked=770, Total=3660 [2023-02-16 03:02:47,231 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 58 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-02-16 03:03:15,882 WARN L233 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 127 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:03:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:03:24,508 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2023-02-16 03:03:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-16 03:03:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) Word has length 74 [2023-02-16 03:03:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:03:24,512 INFO L225 Difference]: With dead ends: 176 [2023-02-16 03:03:24,512 INFO L226 Difference]: Without dead ends: 174 [2023-02-16 03:03:24,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=1003, Invalid=10550, Unknown=31, NotChecked=1526, Total=13110 [2023-02-16 03:03:24,515 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 340 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 156 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 957 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:03:24,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 788 Invalid, 3505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2386 Invalid, 6 Unknown, 957 Unchecked, 5.8s Time] [2023-02-16 03:03:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-16 03:03:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 106. [2023-02-16 03:03:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 77 states have internal predecessors, (85), 21 states have call successors, (21), 5 states have call predecessors, (21), 10 states have return successors, (48), 23 states have call predecessors, (48), 21 states have call successors, (48) [2023-02-16 03:03:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-02-16 03:03:24,540 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 74 [2023-02-16 03:03:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:03:24,541 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-02-16 03:03:24,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-02-16 03:03:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-02-16 03:03:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-16 03:03:24,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:03:24,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-16 03:03:24,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:03:24,747 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 [2023-02-16 03:03:24,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:03:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:03:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1114645218, now seen corresponding path program 1 times [2023-02-16 03:03:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:03:24,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554498355] [2023-02-16 03:03:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:03:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 03:03:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 03:03:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 03:03:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-16 03:03:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-16 03:03:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:03:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-16 03:03:24,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:03:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554498355] [2023-02-16 03:03:24,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554498355] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:03:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29561221] [2023-02-16 03:03:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:24,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:03:24,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:03:24,886 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) [2023-02-16 03:03:24,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:03:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:24,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:03:24,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:03:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-16 03:03:25,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:03:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-16 03:03:25,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29561221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:03:25,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:03:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-02-16 03:03:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327588022] [2023-02-16 03:03:25,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:03:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:03:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:03:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:03:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:03:25,258 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-16 03:03:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:03:25,443 INFO L93 Difference]: Finished difference Result 127 states and 188 transitions. [2023-02-16 03:03:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:03:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 71 [2023-02-16 03:03:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:03:25,444 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:03:25,444 INFO L226 Difference]: Without dead ends: 96 [2023-02-16 03:03:25,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-02-16 03:03:25,445 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:03:25,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 311 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:03:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-16 03:03:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-16 03:03:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 69 states have internal predecessors, (75), 19 states have call successors, (19), 5 states have call predecessors, (19), 10 states have return successors, (43), 21 states have call predecessors, (43), 19 states have call successors, (43) [2023-02-16 03:03:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2023-02-16 03:03:25,462 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 71 [2023-02-16 03:03:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:03:25,462 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2023-02-16 03:03:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-16 03:03:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2023-02-16 03:03:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-16 03:03:25,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:03:25,463 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] [2023-02-16 03:03:25,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:03:25,668 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 [2023-02-16 03:03:25,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:03:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:03:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 2 times [2023-02-16 03:03:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:03:25,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722863808] [2023-02-16 03:03:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:03:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 03:03:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 03:03:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 03:03:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-16 03:03:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-16 03:03:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:03:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-16 03:03:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:03:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722863808] [2023-02-16 03:03:25,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722863808] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:03:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893116635] [2023-02-16 03:03:25,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:03:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:03:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:03:25,875 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) [2023-02-16 03:03:25,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:03:26,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:03:26,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:03:26,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:03:26,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:03:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-16 03:03:26,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:03:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-16 03:03:26,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893116635] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:03:26,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:03:26,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-02-16 03:03:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631639402] [2023-02-16 03:03:26,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:03:26,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:03:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:03:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:03:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:03:26,302 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-16 03:03:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:03:26,425 INFO L93 Difference]: Finished difference Result 148 states and 224 transitions. [2023-02-16 03:03:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:03:26,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 85 [2023-02-16 03:03:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:03:26,426 INFO L225 Difference]: With dead ends: 148 [2023-02-16 03:03:26,426 INFO L226 Difference]: Without dead ends: 101 [2023-02-16 03:03:26,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:03:26,427 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 37 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:03:26,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 263 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:03:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-16 03:03:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2023-02-16 03:03:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 70 states have internal predecessors, (77), 19 states have call successors, (19), 6 states have call predecessors, (19), 10 states have return successors, (41), 21 states have call predecessors, (41), 19 states have call successors, (41) [2023-02-16 03:03:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2023-02-16 03:03:26,440 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 85 [2023-02-16 03:03:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:03:26,441 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2023-02-16 03:03:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-16 03:03:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2023-02-16 03:03:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-16 03:03:26,442 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:03:26,442 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] [2023-02-16 03:03:26,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:03:26,647 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 [2023-02-16 03:03:26,647 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:03:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:03:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 440692874, now seen corresponding path program 3 times [2023-02-16 03:03:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:03:26,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719642782] [2023-02-16 03:03:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:03:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 03:03:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 03:03:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 03:03:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-16 03:03:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 03:03:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-16 03:03:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:03:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-16 03:03:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:03:26,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719642782] [2023-02-16 03:03:26,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719642782] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:03:26,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882861275] [2023-02-16 03:03:26,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 03:03:26,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:03:26,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:03:26,841 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) [2023-02-16 03:03:26,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:03:27,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 03:03:27,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:03:27,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:03:27,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:03:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-02-16 03:03:27,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:03:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-02-16 03:03:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882861275] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:03:28,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:03:28,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 30 [2023-02-16 03:03:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109333021] [2023-02-16 03:03:28,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:03:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:03:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:03:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:03:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:03:28,270 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 30 states, 27 states have (on average 3.0) internal successors, (81), 25 states have internal predecessors, (81), 10 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2023-02-16 03:03:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:03:30,012 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2023-02-16 03:03:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 03:03:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.0) internal successors, (81), 25 states have internal predecessors, (81), 10 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 85 [2023-02-16 03:03:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:03:30,013 INFO L225 Difference]: With dead ends: 179 [2023-02-16 03:03:30,013 INFO L226 Difference]: Without dead ends: 86 [2023-02-16 03:03:30,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 03:03:30,015 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:03:30,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 424 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:03:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-16 03:03:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-16 03:03:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 60 states have internal predecessors, (67), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (37), 18 states have call predecessors, (37), 16 states have call successors, (37) [2023-02-16 03:03:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2023-02-16 03:03:30,038 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 85 [2023-02-16 03:03:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:03:30,040 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2023-02-16 03:03:30,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.0) internal successors, (81), 25 states have internal predecessors, (81), 10 states have call successors, (28), 2 states have call predecessors, (28), 7 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2023-02-16 03:03:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2023-02-16 03:03:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-16 03:03:30,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:03:30,044 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 3, 3, 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] [2023-02-16 03:03:30,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:03:30,250 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 [2023-02-16 03:03:30,250 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:03:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:03:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash 824465766, now seen corresponding path program 4 times [2023-02-16 03:03:30,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:03:30,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059001419] [2023-02-16 03:03:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:03:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:03:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 03:03:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-16 03:03:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 03:03:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 03:03:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-16 03:03:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:03:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 25 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-16 03:03:30,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:03:30,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059001419] [2023-02-16 03:03:30,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059001419] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:03:30,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410025416] [2023-02-16 03:03:30,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 03:03:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:03:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:03:30,633 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) [2023-02-16 03:03:30,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:03:30,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 03:03:30,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:03:30,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:03:30,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:03:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-02-16 03:03:30,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:03:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-02-16 03:03:31,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410025416] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:03:31,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:03:31,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 13] total 30 [2023-02-16 03:03:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027415151] [2023-02-16 03:03:31,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:03:31,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:03:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:03:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:03:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:03:31,747 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 30 states, 23 states have (on average 3.130434782608696) internal successors, (72), 27 states have internal predecessors, (72), 16 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (28), 11 states have call predecessors, (28), 16 states have call successors, (28) [2023-02-16 03:03:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:03:32,346 INFO L93 Difference]: Finished difference Result 148 states and 235 transitions. [2023-02-16 03:03:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:03:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 3.130434782608696) internal successors, (72), 27 states have internal predecessors, (72), 16 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (28), 11 states have call predecessors, (28), 16 states have call successors, (28) Word has length 98 [2023-02-16 03:03:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:03:32,348 INFO L225 Difference]: With dead ends: 148 [2023-02-16 03:03:32,348 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 03:03:32,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 03:03:32,349 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:03:32,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 521 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:03:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 03:03:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 95. [2023-02-16 03:03:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 63 states have internal predecessors, (70), 20 states have call successors, (20), 8 states have call predecessors, (20), 12 states have return successors, (63), 23 states have call predecessors, (63), 20 states have call successors, (63) [2023-02-16 03:03:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2023-02-16 03:03:32,367 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 153 transitions. Word has length 98 [2023-02-16 03:03:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:03:32,368 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 153 transitions. [2023-02-16 03:03:32,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 3.130434782608696) internal successors, (72), 27 states have internal predecessors, (72), 16 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (28), 11 states have call predecessors, (28), 16 states have call successors, (28) [2023-02-16 03:03:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2023-02-16 03:03:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-16 03:03:32,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:03:32,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2023-02-16 03:03:32,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-16 03:03:32,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 03:03:32,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 03:03:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:03:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -931767615, now seen corresponding path program 1 times [2023-02-16 03:03:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:03:32,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545579397] [2023-02-16 03:03:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:03:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:03:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 03:03:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-16 03:03:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 03:03:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 03:03:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-16 03:03:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:03:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-16 03:03:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-16 03:03:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:03:32,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545579397] [2023-02-16 03:03:32,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545579397] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:03:32,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431471805] [2023-02-16 03:03:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:03:32,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:03:32,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:03:32,752 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:03:32,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:03:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:03:32,911 WARN L261 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 202 conjunts are in the unsatisfiable core [2023-02-16 03:03:32,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:03:32,918 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:03:32,947 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:03:32,988 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:03:32,988 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:03:33,007 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1172 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1172))) is different from true [2023-02-16 03:03:33,012 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:03:33,038 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-16 03:03:33,040 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 03:03:33,092 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 30 [2023-02-16 03:03:33,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:03:33,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2023-02-16 03:03:33,145 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 30 [2023-02-16 03:03:33,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:03:33,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2023-02-16 03:03:33,310 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)) (select .cse0 .cse1))))))) is different from true [2023-02-16 03:03:33,356 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1181 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~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_1181)))) is different from true [2023-02-16 03:03:33,417 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1184 Int) (v_upsweep_~left_183 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~left| 4)))) (store .cse0 .cse1 (+ (select .cse0 (+ |c_upsweep_#in~a.offset| (* v_upsweep_~left_183 4))) (select .cse0 .cse1)))) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_1184)))) (< (+ |c_upsweep_#in~left| 1) |c_upsweep_#in~right|)) is different from true [2023-02-16 03:03:33,446 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 52 [2023-02-16 03:03:33,513 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 68 [2023-02-16 03:03:33,661 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int)) (and (= |c_#memory_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)))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4))) (.cse2 (select .cse0 .cse1))) (store (store .cse0 .cse1 (+ .cse2 (select .cse0 .cse3))) .cse3 .cse2))))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-16 03:03:33,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1193 Int) (downsweep_~left Int)) (= |c_#memory_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_1193) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))))) is different from true [2023-02-16 03:03:34,003 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse5 (select .cse10 .cse2)) (.cse4 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (let ((.cse3 (store .cse10 .cse2 (+ .cse5 (select .cse10 .cse4))))) (let ((.cse0 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse6 (store .cse3 .cse4 .cse5))) (or (exists ((v_ArrVal_1193 Int) (v_downsweep_~left_143 Int) (downsweep_~left Int)) (and (<= (+ .cse0 v_downsweep_~left_143 1) |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse1 (let ((.cse7 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_143 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse7))) .cse7 .cse5)))) (store (store .cse1 .cse2 v_ArrVal_1193) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse1 .cse2))))))) (and (exists ((v_ArrVal_1193 Int) (v_downsweep_~left_143 Int) (downsweep_~left Int)) (and (<= (+ .cse0 v_downsweep_~left_143) |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse8 (let ((.cse9 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_143 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse9))) .cse9 .cse5)))) (store (store .cse8 .cse2 v_ArrVal_1193) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse8 .cse2))))))) (or (not (< |c_downsweep_#in~right| |c_downsweep_#in~left|)) (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))))))))) is different from true [2023-02-16 03:03:34,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 571 treesize of output 517 [2023-02-16 03:03:34,142 INFO L350 Elim1Store]: Elim1 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 277 treesize of output 270 [2023-02-16 03:03:50,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:03:50,967 INFO L350 Elim1Store]: Elim1 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 488 treesize of output 476 [2023-02-16 03:03:50,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 905 treesize of output 899 [2023-02-16 03:03:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 17 not checked. [2023-02-16 03:03:51,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:04:30,140 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~n~0#1| 4) (- 4))) (.cse0 (div |c_ULTIMATE.start_main_~n~0#1| 2))) (let ((.cse17 (= 0 (mod |c_ULTIMATE.start_main_~n~0#1| 2))) (.cse16 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse13 (- .cse0)) (.cse6 (select .cse14 .cse3)) (.cse15 (* .cse0 4))) (and (or (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse15))) (let ((.cse4 (store .cse14 .cse3 (+ .cse6 (select .cse14 .cse5))))) (let ((.cse7 (store .cse4 .cse5 .cse6)) (.cse9 (div (+ .cse13 |c_ULTIMATE.start_main_~n~0#1| (- 1)) 2))) (and (or (not (= 0 (mod (+ .cse0 |c_ULTIMATE.start_main_~n~0#1| 1) 2))) (forall ((v_downsweep_~left_158 Int) (v_downsweep_~left_159 Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_check_~i~0#1_30| Int) (|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (let ((.cse1 (let ((.cse2 (let ((.cse8 (+ (* v_downsweep_~left_159 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse4 .cse5 (+ .cse6 (select .cse7 .cse8))) .cse8 .cse6)))) (store (store .cse2 .cse3 v_ArrVal_1209) (+ (* v_downsweep_~left_158 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 .cse3))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse1 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|) (< .cse0 (+ v_downsweep_~left_159 .cse9))))) (forall ((|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (forall ((|v_ULTIMATE.start_check_~i~0#1_30| Int)) (or (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (forall ((v_downsweep_~left_158 Int) (v_downsweep_~left_159 Int) (v_ArrVal_1209 Int)) (or (let ((.cse10 (let ((.cse11 (let ((.cse12 (+ (* v_downsweep_~left_159 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse4 .cse5 (+ .cse6 (select .cse7 .cse12))) .cse12 .cse6)))) (store (store .cse11 .cse3 v_ArrVal_1209) (+ (* v_downsweep_~left_158 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse11 .cse3))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse10 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))) (< .cse0 (+ v_downsweep_~left_159 .cse9 1)))))) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|))))))) (not .cse16) .cse17) (or (and (not .cse17) .cse16) (let ((.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse15 (- 4)))) (let ((.cse20 (store .cse14 .cse3 (+ .cse6 (select .cse14 .cse21))))) (let ((.cse24 (div (+ .cse13 |c_ULTIMATE.start_main_~n~0#1|) 2)) (.cse22 (store .cse20 .cse21 .cse6))) (and (forall ((|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|) (forall ((|v_ULTIMATE.start_check_~i~0#1_30| Int)) (or (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (forall ((v_downsweep_~left_158 Int) (v_downsweep_~left_159 Int) (v_ArrVal_1209 Int)) (or (let ((.cse18 (let ((.cse19 (let ((.cse23 (+ (* v_downsweep_~left_159 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse20 .cse21 (+ (select .cse22 .cse23) .cse6)) .cse23 .cse6)))) (store (store .cse19 .cse3 v_ArrVal_1209) (+ (* v_downsweep_~left_158 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse19 .cse3))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse18 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))) (< .cse0 (+ v_downsweep_~left_159 .cse24 2)))))))) (or (forall ((v_downsweep_~left_158 Int) (v_downsweep_~left_159 Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_check_~i~0#1_30| Int) (|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (< .cse0 (+ v_downsweep_~left_159 .cse24 1)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (+ (* v_downsweep_~left_159 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse20 .cse21 (+ (select .cse22 .cse27) .cse6)) .cse27 .cse6)))) (store (store .cse26 .cse3 v_ArrVal_1209) (+ (* v_downsweep_~left_158 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse26 .cse3))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse25 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))) (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|))) (and (not (= 0 (mod (+ .cse0 |c_ULTIMATE.start_main_~n~0#1|) 2))) (< |c_ULTIMATE.start_main_~n~0#1| .cse0))))))))))) is different from false [2023-02-16 03:04:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431471805] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:04:30,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:04:30,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 35] total 42 [2023-02-16 03:04:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443588243] [2023-02-16 03:04:30,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:04:30,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-16 03:04:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:04:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-16 03:04:30,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1510, Unknown=24, NotChecked=680, Total=2352 [2023-02-16 03:04:30,283 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. Second operand has 42 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 10 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 10 states have call successors, (19) [2023-02-16 03:04:33,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:04:36,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4|) 1)) (let ((.cse10 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse5 (select .cse10 .cse2)) (.cse4 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (let ((.cse3 (store .cse10 .cse2 (+ .cse5 (select .cse10 .cse4))))) (let ((.cse0 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse6 (store .cse3 .cse4 .cse5))) (or (exists ((v_ArrVal_1193 Int) (v_downsweep_~left_143 Int) (downsweep_~left Int)) (and (<= (+ .cse0 v_downsweep_~left_143 1) |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse1 (let ((.cse7 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_143 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse7))) .cse7 .cse5)))) (store (store .cse1 .cse2 v_ArrVal_1193) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse1 .cse2))))))) (and (exists ((v_ArrVal_1193 Int) (v_downsweep_~left_143 Int) (downsweep_~left Int)) (and (<= (+ .cse0 v_downsweep_~left_143) |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse8 (let ((.cse9 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_143 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse9))) .cse9 .cse5)))) (store (store .cse8 .cse2 v_ArrVal_1193) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse8 .cse2))))))) (or (not (< |c_downsweep_#in~right| |c_downsweep_#in~left|)) (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2)))))))))) is different from true [2023-02-16 03:04:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:04:40,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:04:46,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:04:48,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:04:59,003 WARN L233 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 110 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)