./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 6c24879c 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-?-6c24879 [2022-07-12 06:29:21,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:29:21,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:29:21,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:29:21,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:29:21,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:29:21,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:29:21,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:29:21,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:29:21,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:29:21,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:29:21,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:29:21,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:29:21,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:29:21,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:29:21,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:29:21,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:29:21,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:29:21,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:29:21,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:29:21,117 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:29:21,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:29:21,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:29:21,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:29:21,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:29:21,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:29:21,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:29:21,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:29:21,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:29:21,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:29:21,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:29:21,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:29:21,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:29:21,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:29:21,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:29:21,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:29:21,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:29:21,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:29:21,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:29:21,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:29:21,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:29:21,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:29:21,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:29:21,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:29:21,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:29:21,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:29:21,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:29:21,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:29:21,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:29:21,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:29:21,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:29:21,174 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:29:21,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:29:21,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:29:21,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:29:21,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:29:21,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:29:21,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:29:21,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:29:21,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:29:21,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:29:21,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:29:21,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:29:21,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:29:21,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:29:21,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:29:21,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:29:21,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:29:21,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:29:21,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:29:21,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:29:21,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-07-12 06:29:21,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:29:21,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:29:21,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:29:21,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:29:21,437 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:29:21,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-12 06:29:21,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2498f200/d50ddd91ad7c4990a643c690282f9c74/FLAG4f9d9d674 [2022-07-12 06:29:21,916 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:29:21,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-12 06:29:21,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2498f200/d50ddd91ad7c4990a643c690282f9c74/FLAG4f9d9d674 [2022-07-12 06:29:21,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2498f200/d50ddd91ad7c4990a643c690282f9c74 [2022-07-12 06:29:21,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:29:21,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:29:21,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:29:21,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:29:21,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:29:21,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:29:21" (1/1) ... [2022-07-12 06:29:21,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebe1394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:21, skipping insertion in model container [2022-07-12 06:29:21,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:29:21" (1/1) ... [2022-07-12 06:29:21,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:29:21,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:29:22,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-07-12 06:29:22,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:29:22,174 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:29:22,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-07-12 06:29:22,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:29:22,207 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:29:22,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22 WrapperNode [2022-07-12 06:29:22,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:29:22,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:29:22,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:29:22,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:29:22,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,245 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-07-12 06:29:22,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:29:22,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:29:22,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:29:22,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:29:22,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:29:22,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:29:22,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:29:22,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:29:22,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (1/1) ... [2022-07-12 06:29:22,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:29:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:22,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 06:29:22,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 06:29:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:29:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 06:29:22,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 06:29:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:29:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-07-12 06:29:22,372 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-07-12 06:29:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 06:29:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 06:29:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-07-12 06:29:22,372 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-07-12 06:29:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:29:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:29:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 06:29:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 06:29:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 06:29:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 06:29:22,453 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:29:22,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:29:24,820 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:29:24,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:29:24,829 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 06:29:24,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:29:24 BoogieIcfgContainer [2022-07-12 06:29:24,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:29:24,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:29:24,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:29:24,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:29:24,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:29:21" (1/3) ... [2022-07-12 06:29:24,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b35ba26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:29:24, skipping insertion in model container [2022-07-12 06:29:24,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:29:22" (2/3) ... [2022-07-12 06:29:24,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b35ba26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:29:24, skipping insertion in model container [2022-07-12 06:29:24,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:29:24" (3/3) ... [2022-07-12 06:29:24,838 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-07-12 06:29:24,850 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:29:24,850 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:29:24,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:29:24,894 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17402775, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bc7ff59 [2022-07-12 06:29:24,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:29:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 06:29:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:29:24,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:24,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:24,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2022-07-12 06:29:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:24,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514300378] [2022-07-12 06:29:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:29:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:29:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:29:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 06:29:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 06:29:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:29:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514300378] [2022-07-12 06:29:25,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514300378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:29:25,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:29:25,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:29:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812168641] [2022-07-12 06:29:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:29:25,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:29:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:29:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:29:25,272 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:29:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:25,375 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-12 06:29:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:29:25,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-12 06:29:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:25,388 INFO L225 Difference]: With dead ends: 96 [2022-07-12 06:29:25,389 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 06:29:25,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:29:25,396 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:25,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:29:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 06:29:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-12 06:29:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 06:29:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-12 06:29:25,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2022-07-12 06:29:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:25,443 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-12 06:29:25,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:29:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-12 06:29:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:29:25,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:25,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:29:25,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2022-07-12 06:29:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134462824] [2022-07-12 06:29:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:29:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:29:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:29:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 06:29:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 06:29:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:29:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134462824] [2022-07-12 06:29:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134462824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:29:25,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:29:25,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:29:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824402691] [2022-07-12 06:29:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:29:25,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:29:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:29:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:29:25,700 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:29:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:25,990 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-07-12 06:29:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:29:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-12 06:29:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:25,992 INFO L225 Difference]: With dead ends: 87 [2022-07-12 06:29:25,992 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 06:29:25,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:29:25,994 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:25,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:29:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 06:29:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-07-12 06:29:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 06:29:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-12 06:29:26,004 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2022-07-12 06:29:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:26,005 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-12 06:29:26,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:29:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-12 06:29:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 06:29:26,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:26,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:26,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:29:26,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2022-07-12 06:29:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:26,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117967497] [2022-07-12 06:29:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:29:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:29:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:29:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 06:29:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:29:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:29:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:26,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117967497] [2022-07-12 06:29:26,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117967497] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:26,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2890390] [2022-07-12 06:29:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:26,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:29:26,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:29:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:26,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:29:26,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:29:26,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:29:26,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2890390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:29:26,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:29:26,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-12 06:29:26,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012866775] [2022-07-12 06:29:26,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:26,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 06:29:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 06:29:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:29:26,645 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 06:29:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:26,933 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-12 06:29:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:29:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2022-07-12 06:29:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:26,936 INFO L225 Difference]: With dead ends: 73 [2022-07-12 06:29:26,936 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 06:29:26,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:29:26,937 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:26,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:29:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 06:29:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-12 06:29:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 06:29:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-12 06:29:26,949 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2022-07-12 06:29:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:26,949 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-12 06:29:26,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 06:29:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-12 06:29:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 06:29:26,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:26,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:26,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:27,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2022-07-12 06:29:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560691517] [2022-07-12 06:29:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:29:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:29:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:29:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:29:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 06:29:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:29:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:27,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560691517] [2022-07-12 06:29:27,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560691517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994098224] [2022-07-12 06:29:27,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:29:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:27,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:29:27,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:29:27,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:29:27,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:29:27,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 06:29:27,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:27,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 06:29:28,694 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-12 06:29:28,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 27 [2022-07-12 06:29:29,062 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-12 06:29:29,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-07-12 06:29:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:29:29,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:29,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994098224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:29,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:29:29,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-07-12 06:29:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190244199] [2022-07-12 06:29:29,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:29,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 06:29:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 06:29:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:29:29,407 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 06:29:31,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 06:29:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:32,502 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-12 06:29:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 06:29:32,503 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2022-07-12 06:29:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:32,505 INFO L225 Difference]: With dead ends: 99 [2022-07-12 06:29:32,505 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 06:29:32,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 06:29:32,507 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:32,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 377 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 363 Invalid, 1 Unknown, 149 Unchecked, 2.5s Time] [2022-07-12 06:29:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 06:29:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-07-12 06:29:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-12 06:29:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-12 06:29:32,525 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 48 [2022-07-12 06:29:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:32,526 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-12 06:29:32,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 06:29:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-12 06:29:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 06:29:32,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:32,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:32,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:32,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 06:29:32,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560803, now seen corresponding path program 1 times [2022-07-12 06:29:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923527929] [2022-07-12 06:29:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:29:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:29:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:29:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 06:29:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:29:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 06:29:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923527929] [2022-07-12 06:29:34,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923527929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162675584] [2022-07-12 06:29:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:34,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:34,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:34,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:29:34,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:29:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:34,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-12 06:29:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:34,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 06:29:35,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 06:29:35,167 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 06:29:35,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 06:29:35,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2022-07-12 06:29:35,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-07-12 06:29:35,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-12 06:29:39,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-07-12 06:29:41,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-12 06:29:43,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_181 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181))) |c_#memory_int|)) is different from true [2022-07-12 06:29:43,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-07-12 06:29:49,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-07-12 06:29:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 06:29:49,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:02,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0))) (and (or (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int) (v_ArrVal_188 Int)) (or (let ((.cse0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse3) (select .cse1 .cse2)))) .cse3 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|))) (not .cse4) .cse5) (or (and .cse4 (not .cse5)) (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int) (v_ArrVal_188 Int)) (or (let ((.cse6 (let ((.cse9 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse9) (select .cse7 .cse8)))) .cse9 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|)))))) is different from false [2022-07-12 06:30:02,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162675584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:02,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:30:02,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-07-12 06:30:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707746665] [2022-07-12 06:30:02,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 06:30:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 06:30:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2007, Unknown=11, NotChecked=182, Total=2352 [2022-07-12 06:30:02,331 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-12 06:30:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:29,975 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-07-12 06:30:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 06:30:29,976 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-12 06:30:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:29,977 INFO L225 Difference]: With dead ends: 91 [2022-07-12 06:30:29,977 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 06:30:29,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=327, Invalid=3689, Unknown=24, NotChecked=250, Total=4290 [2022-07-12 06:30:29,979 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:29,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 491 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 259 Unchecked, 0.5s Time] [2022-07-12 06:30:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 06:30:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-12 06:30:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-12 06:30:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-07-12 06:30:29,996 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 53 [2022-07-12 06:30:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:29,996 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-07-12 06:30:29,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-12 06:30:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-07-12 06:30:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 06:30:29,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:29,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:30,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:30,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 1 times [2022-07-12 06:30:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:30,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262517820] [2022-07-12 06:30:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:30:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:30:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:30:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 06:30:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 06:30:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 06:30:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:30,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262517820] [2022-07-12 06:30:30,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262517820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273569059] [2022-07-12 06:30:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:30,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:30,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:30,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:30:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:30,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 06:30:30,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 06:30:30,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 06:30:30,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273569059] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:30,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:30,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-12 06:30:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165764964] [2022-07-12 06:30:30,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:30:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:30:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:30:30,722 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 06:30:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:30,958 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2022-07-12 06:30:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:30:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2022-07-12 06:30:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:30,960 INFO L225 Difference]: With dead ends: 115 [2022-07-12 06:30:30,960 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 06:30:30,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:30:30,962 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:30,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:30:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 06:30:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-12 06:30:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-12 06:30:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2022-07-12 06:30:30,977 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 54 [2022-07-12 06:30:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:30,977 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2022-07-12 06:30:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 06:30:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-07-12 06:30:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:30:30,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:30,979 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:30,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:31,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:31,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:31,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 2 times [2022-07-12 06:30:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:31,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300834482] [2022-07-12 06:30:31,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:30:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:30:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:30:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 06:30:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:30:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:30:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:31,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300834482] [2022-07-12 06:30:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300834482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:31,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890609405] [2022-07-12 06:30:31,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:30:31,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:31,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:31,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:30:31,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:30:31,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:30:31,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:30:31,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:30:31,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:30:31,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890609405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:31,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:31,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-07-12 06:30:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872857227] [2022-07-12 06:30:31,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:31,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 06:30:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 06:30:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:30:31,641 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:30:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:31,996 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-07-12 06:30:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 06:30:31,996 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-07-12 06:30:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:31,998 INFO L225 Difference]: With dead ends: 127 [2022-07-12 06:30:31,998 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 06:30:31,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-07-12 06:30:31,999 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:31,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 421 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:30:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 06:30:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-12 06:30:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-12 06:30:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-12 06:30:32,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 57 [2022-07-12 06:30:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:32,014 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-12 06:30:32,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:30:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-12 06:30:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 06:30:32,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:32,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:32,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 06:30:32,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:32,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2022-07-12 06:30:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:32,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336544291] [2022-07-12 06:30:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:30:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:30:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:30:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 06:30:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:30:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:30:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 06:30:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336544291] [2022-07-12 06:30:32,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336544291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709011087] [2022-07-12 06:30:32,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:32,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:32,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:32,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:32,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 06:30:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:32,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 06:30:32,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 06:30:32,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 06:30:33,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709011087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:33,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:33,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-12 06:30:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998948733] [2022-07-12 06:30:33,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:33,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 06:30:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 06:30:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-12 06:30:33,110 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 06:30:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:33,699 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-12 06:30:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 06:30:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 59 [2022-07-12 06:30:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:33,701 INFO L225 Difference]: With dead ends: 106 [2022-07-12 06:30:33,701 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 06:30:33,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-07-12 06:30:33,703 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:33,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 06:30:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 06:30:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-12 06:30:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-12 06:30:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-12 06:30:33,717 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 59 [2022-07-12 06:30:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:33,717 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-12 06:30:33,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 06:30:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-12 06:30:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 06:30:33,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:33,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:33,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:33,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:33,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2022-07-12 06:30:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292913256] [2022-07-12 06:30:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:30:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:30:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:30:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 06:30:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:30:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 06:30:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:30:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292913256] [2022-07-12 06:30:34,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292913256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627797236] [2022-07-12 06:30:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:34,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:34,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:34,132 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:34,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 06:30:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:34,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:30:34,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:30:34,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:30:34,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627797236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:34,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:34,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-12 06:30:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513467520] [2022-07-12 06:30:34,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 06:30:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 06:30:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-12 06:30:34,810 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 06:30:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:35,080 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-12 06:30:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:30:35,082 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2022-07-12 06:30:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:35,083 INFO L225 Difference]: With dead ends: 103 [2022-07-12 06:30:35,083 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 06:30:35,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-12 06:30:35,084 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:35,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:30:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 06:30:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-07-12 06:30:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-12 06:30:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-12 06:30:35,098 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 65 [2022-07-12 06:30:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:35,099 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-12 06:30:35,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 06:30:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-12 06:30:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 06:30:35,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:35,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:35,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:35,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:35,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash -838921823, now seen corresponding path program 1 times [2022-07-12 06:30:35,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:35,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431193437] [2022-07-12 06:30:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:30:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:30:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:30:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 06:30:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:30:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 06:30:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 06:30:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431193437] [2022-07-12 06:30:35,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431193437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724080146] [2022-07-12 06:30:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:35,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:35,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 06:30:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:35,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 06:30:35,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 06:30:35,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 06:30:35,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724080146] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:35,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:35,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-12 06:30:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924475744] [2022-07-12 06:30:35,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 06:30:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:35,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 06:30:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:30:35,817 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 06:30:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:36,025 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-12 06:30:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:30:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-12 06:30:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:36,027 INFO L225 Difference]: With dead ends: 67 [2022-07-12 06:30:36,027 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 06:30:36,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-12 06:30:36,037 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:36,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:30:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 06:30:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-12 06:30:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-12 06:30:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-07-12 06:30:36,058 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 66 [2022-07-12 06:30:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:36,060 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-07-12 06:30:36,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 06:30:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-07-12 06:30:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 06:30:36,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:36,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:36,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 06:30:36,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2022-07-12 06:30:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689549587] [2022-07-12 06:30:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:30:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:30:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:30:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 06:30:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:30:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 06:30:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:30:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 06:30:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:36,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689549587] [2022-07-12 06:30:36,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689549587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:36,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426954371] [2022-07-12 06:30:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:36,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:36,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:30:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 06:30:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:36,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-12 06:30:36,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:36,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 06:30:36,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 06:30:36,862 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 06:30:36,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 06:30:36,894 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_545 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_545) |c_#memory_int|)) is different from true [2022-07-12 06:30:36,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:30:36,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:30:36,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:30:37,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:30:41,448 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_552 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_552)))) is different from true [2022-07-12 06:30:52,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-12 06:30:52,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2022-07-12 06:30:56,871 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-07-12 06:31:02,320 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-07-12 06:31:06,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 143 [2022-07-12 06:31:15,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2022-07-12 06:31:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-07-12 06:31:15,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:31:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426954371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:31:23,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:31:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36] total 47 [2022-07-12 06:31:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188418780] [2022-07-12 06:31:23,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 06:31:23,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 06:31:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:31:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 06:31:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1925, Unknown=21, NotChecked=364, Total=2450 [2022-07-12 06:31:23,524 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-12 06:31:25,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 06:31:40,499 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 53 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 06:31:42,507 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|)))) is different from true [2022-07-12 06:31:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:31:42,532 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2022-07-12 06:31:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 06:31:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 72 [2022-07-12 06:31:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:31:42,535 INFO L225 Difference]: With dead ends: 125 [2022-07-12 06:31:42,535 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 06:31:42,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=394, Invalid=5147, Unknown=29, NotChecked=750, Total=6320 [2022-07-12 06:31:42,537 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1016 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 06:31:42,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 470 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 828 Invalid, 1 Unknown, 1016 Unchecked, 2.6s Time] [2022-07-12 06:31:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 06:31:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-07-12 06:31:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2022-07-12 06:31:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-07-12 06:31:42,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2022-07-12 06:31:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:31:42,549 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-07-12 06:31:42,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-12 06:31:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-07-12 06:31:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 06:31:42,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:31:42,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:31:42,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 06:31:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:31:42,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:31:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:31:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2022-07-12 06:31:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:31:42,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651184705] [2022-07-12 06:31:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:31:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:31:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:31:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 06:31:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:31:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 06:31:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:31:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:31:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:31:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:31:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:31:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:31:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:31:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 06:31:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:31:43,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651184705] [2022-07-12 06:31:43,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651184705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:31:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493902202] [2022-07-12 06:31:43,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:31:43,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:31:43,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:31:43,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:31:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 06:31:43,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:31:43,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:31:43,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 172 conjunts are in the unsatisfiable core [2022-07-12 06:31:43,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:31:43,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 06:31:43,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 06:31:43,278 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 06:31:43,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 06:31:43,309 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_683 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_683) |c_#memory_int|)) is different from true [2022-07-12 06:31:43,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:31:43,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:31:43,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:31:43,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:31:43,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 06:31:44,258 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|)) is different from true [2022-07-12 06:31:46,692 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) is different from true [2022-07-12 06:31:52,469 WARN L855 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_693 Int) (v_ArrVal_688 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_688) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_693)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2022-07-12 06:31:52,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-07-12 06:31:54,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 06:31:59,808 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|)) is different from true [2022-07-12 06:32:02,813 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2022-07-12 06:32:04,914 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2) 0)) (.cse0 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (and .cse0 (not .cse1) (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse2 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse2 .cse3 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse2 .cse3))) .cse3 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|) (<= |c_downsweep_#in~right| (+ (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2) downsweep_~left 1))))) (and (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse5 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse4 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse4 .cse5 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse4 .cse5))) .cse5 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|) (<= |c_downsweep_#in~right| (+ (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2) downsweep_~left)))) (or .cse1 (not .cse0))))) is different from true [2022-07-12 06:32:04,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 210 [2022-07-12 06:32:05,037 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 06:32:15,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2022-07-12 06:32:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 17 not checked. [2022-07-12 06:32:15,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:32:25,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493902202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:25,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:32:25,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-07-12 06:32:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521735820] [2022-07-12 06:32:25,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 06:32:25,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 06:32:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 06:32:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=28, NotChecked=532, Total=1892 [2022-07-12 06:32:25,905 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-12 06:32:27,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 06:32:40,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|))) is different from true [2022-07-12 06:32:48,239 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|))) is different from true [2022-07-12 06:32:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:48,273 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2022-07-12 06:32:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 06:32:48,274 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) Word has length 74 [2022-07-12 06:32:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:48,275 INFO L225 Difference]: With dead ends: 137 [2022-07-12 06:32:48,275 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 06:32:48,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=461, Invalid=4093, Unknown=38, NotChecked=1260, Total=5852 [2022-07-12 06:32:48,278 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1262 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:48,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 396 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 566 Invalid, 1 Unknown, 1262 Unchecked, 2.7s Time] [2022-07-12 06:32:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 06:32:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-07-12 06:32:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-12 06:32:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2022-07-12 06:32:48,290 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 74 [2022-07-12 06:32:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:48,291 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2022-07-12 06:32:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-12 06:32:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2022-07-12 06:32:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 06:32:48,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:48,293 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:32:48,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 06:32:48,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 06:32:48,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 1 times [2022-07-12 06:32:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846071867] [2022-07-12 06:32:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:32:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:32:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:32:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 06:32:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:32:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:32:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:32:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:32:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 06:32:48,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:48,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846071867] [2022-07-12 06:32:48,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846071867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:48,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797487655] [2022-07-12 06:32:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:48,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:48,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:48,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:32:48,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 06:32:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:48,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 06:32:48,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:32:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 06:32:49,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:32:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 06:32:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797487655] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:32:50,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:32:50,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 12] total 33 [2022-07-12 06:32:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833494269] [2022-07-12 06:32:50,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:32:50,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 06:32:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:50,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 06:32:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 06:32:50,079 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-12 06:32:52,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 06:32:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:53,389 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2022-07-12 06:32:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 06:32:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) Word has length 85 [2022-07-12 06:32:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:53,391 INFO L225 Difference]: With dead ends: 157 [2022-07-12 06:32:53,391 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 06:32:53,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=2436, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 06:32:53,393 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:53,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 989 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 06:32:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 06:32:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2022-07-12 06:32:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (29), 19 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-12 06:32:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2022-07-12 06:32:53,410 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 85 [2022-07-12 06:32:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:53,411 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2022-07-12 06:32:53,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-12 06:32:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2022-07-12 06:32:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 06:32:53,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:53,413 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:32:53,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 06:32:53,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 06:32:53,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1782863912, now seen corresponding path program 2 times [2022-07-12 06:32:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:53,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897051085] [2022-07-12 06:32:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:32:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:32:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:32:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:32:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:32:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 06:32:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:32:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:32:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:32:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 06:32:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:53,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897051085] [2022-07-12 06:32:53,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897051085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636431394] [2022-07-12 06:32:53,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:32:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:53,832 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:32:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 06:32:53,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:32:53,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:32:53,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:32:53,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:32:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 06:32:54,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:32:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 06:32:54,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636431394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:32:54,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:32:54,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-07-12 06:32:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250448664] [2022-07-12 06:32:54,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:32:54,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:32:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:32:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:32:54,427 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 06:32:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:54,620 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-07-12 06:32:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 06:32:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-12 06:32:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:54,621 INFO L225 Difference]: With dead ends: 116 [2022-07-12 06:32:54,621 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 06:32:54,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:32:54,622 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:54,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:32:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 06:32:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-12 06:32:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1) internal successors, (77), 69 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (27), 19 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-12 06:32:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-12 06:32:54,637 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 97 [2022-07-12 06:32:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:54,637 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-12 06:32:54,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 06:32:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-12 06:32:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 06:32:54,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:54,638 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:32:54,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 06:32:54,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 06:32:54,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1157064136, now seen corresponding path program 3 times [2022-07-12 06:32:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:54,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305950800] [2022-07-12 06:32:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 06:32:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 06:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:32:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:32:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 06:32:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 06:32:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:32:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:32:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 06:32:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 06:32:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305950800] [2022-07-12 06:32:55,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305950800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489651288] [2022-07-12 06:32:55,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:32:55,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:55,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:32:55,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 06:32:55,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 06:32:55,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:32:55,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-12 06:32:55,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:06,269 WARN L833 $PredicateComparison]: unable to prove that (and (= (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) |c_ULTIMATE.start_is_pow2_~x#1|) (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-12 06:33:32,123 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_is_pow2_#res#1| 0) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start_is_pow2_#res#1| 1)))) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-12 06:33:51,688 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_main_#t~ret14#1| 0) (not .cse0)) (and (= |c_ULTIMATE.start_main_#t~ret14#1| 1) .cse0))) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false