./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr3.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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:09:31,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:09:31,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:09:31,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:09:31,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:09:31,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:09:31,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:09:31,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:09:31,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:09:31,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:09:31,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:09:31,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:09:31,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:09:31,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:09:31,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:09:31,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:09:31,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:09:31,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:09:31,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:09:31,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:09:31,129 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:09:31,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:09:31,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:09:31,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:09:31,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:09:31,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:09:31,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:09:31,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:09:31,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:09:31,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:09:31,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:09:31,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:09:31,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:09:31,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:09:31,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:09:31,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:09:31,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:09:31,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:09:31,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:09:31,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:09:31,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:09:31,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:09:31,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:09:31,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:09:31,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:09:31,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:09:31,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:09:31,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:09:31,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:09:31,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:09:31,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:09:31,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:09:31,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:09:31,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:09:31,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:09:31,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:09:31,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:09:31,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:09:31,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:09:31,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:09:31,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:09:31,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:09:31,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:09:31,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:09:31,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:09:31,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:09:31,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:09:31,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:09:31,187 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:09:31,188 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:09:31,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:09:31,188 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2022-07-20 21:09:31,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:09:31,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:09:31,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:09:31,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:09:31,451 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:09:31,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2022-07-20 21:09:31,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3046fced/f18c8b0c2c6f466f805c6f169a4295d5/FLAGba9a24e71 [2022-07-20 21:09:31,887 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:09:31,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2022-07-20 21:09:31,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3046fced/f18c8b0c2c6f466f805c6f169a4295d5/FLAGba9a24e71 [2022-07-20 21:09:31,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3046fced/f18c8b0c2c6f466f805c6f169a4295d5 [2022-07-20 21:09:31,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:09:31,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:09:31,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:09:31,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:09:31,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:09:31,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:09:31" (1/1) ... [2022-07-20 21:09:31,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2ee2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:31, skipping insertion in model container [2022-07-20 21:09:31,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:09:31" (1/1) ... [2022-07-20 21:09:31,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:09:31,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:09:32,056 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/array-tiling/nr3.c[394,407] [2022-07-20 21:09:32,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:09:32,094 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:09:32,108 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/array-tiling/nr3.c[394,407] [2022-07-20 21:09:32,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:09:32,140 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:09:32,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32 WrapperNode [2022-07-20 21:09:32,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:09:32,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:09:32,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:09:32,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:09:32,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,182 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-20 21:09:32,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:09:32,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:09:32,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:09:32,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:09:32,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:09:32,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:09:32,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:09:32,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:09:32,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (1/1) ... [2022-07-20 21:09:32,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:09:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:32,253 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-20 21:09:32,276 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-20 21:09:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:09:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:09:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:09:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:09:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:09:32,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:09:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:09:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:09:32,342 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:09:32,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:09:32,448 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:09:32,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:09:32,453 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:09:32,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:09:32 BoogieIcfgContainer [2022-07-20 21:09:32,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:09:32,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:09:32,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:09:32,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:09:32,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:09:31" (1/3) ... [2022-07-20 21:09:32,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636c444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:09:32, skipping insertion in model container [2022-07-20 21:09:32,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:32" (2/3) ... [2022-07-20 21:09:32,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636c444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:09:32, skipping insertion in model container [2022-07-20 21:09:32,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:09:32" (3/3) ... [2022-07-20 21:09:32,461 INFO L111 eAbstractionObserver]: Analyzing ICFG nr3.c [2022-07-20 21:09:32,473 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:09:32,474 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:09:32,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:09:32,519 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@1233a1ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4231dc61 [2022-07-20 21:09:32,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:09:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:32,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:32,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:32,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-20 21:09:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:32,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603169716] [2022-07-20 21:09:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:32,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603169716] [2022-07-20 21:09:32,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603169716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:32,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:32,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:09:32,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868273034] [2022-07-20 21:09:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:32,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:09:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:09:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:09:32,721 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:32,732 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-20 21:09:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:09:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 21:09:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:32,739 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:09:32,739 INFO L226 Difference]: Without dead ends: 20 [2022-07-20 21:09:32,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:09:32,744 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:32,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-20 21:09:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-20 21:09:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-20 21:09:32,770 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-20 21:09:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:32,770 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-20 21:09:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-20 21:09:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:32,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:32,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:32,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:09:32,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-20 21:09:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489477289] [2022-07-20 21:09:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489477289] [2022-07-20 21:09:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489477289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:32,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:09:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917888531] [2022-07-20 21:09:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:32,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:09:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:09:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:09:32,868 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:32,907 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-20 21:09:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:32,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 21:09:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:32,908 INFO L225 Difference]: With dead ends: 29 [2022-07-20 21:09:32,908 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:32,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:32,910 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:32,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-20 21:09:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 21:09:32,915 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-20 21:09:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:32,915 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 21:09:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 21:09:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:32,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:32,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:09:32,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-20 21:09:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:32,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149210818] [2022-07-20 21:09:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149210818] [2022-07-20 21:09:33,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149210818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:33,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:33,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 21:09:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177585992] [2022-07-20 21:09:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:33,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:09:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:09:33,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:33,095 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:33,144 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-20 21:09:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 21:09:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:33,146 INFO L225 Difference]: With dead ends: 38 [2022-07-20 21:09:33,146 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:33,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:33,147 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:33,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-20 21:09:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 21:09:33,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-20 21:09:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:33,165 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 21:09:33,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 21:09:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:09:33,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:33,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:33,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 21:09:33,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-20 21:09:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:33,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704199409] [2022-07-20 21:09:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:33,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704199409] [2022-07-20 21:09:33,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704199409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:33,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:33,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:09:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012711053] [2022-07-20 21:09:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:33,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:09:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:09:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:09:33,245 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:33,277 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-20 21:09:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:09:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 21:09:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:33,279 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:09:33,279 INFO L226 Difference]: Without dead ends: 26 [2022-07-20 21:09:33,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:09:33,281 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:33,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-20 21:09:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-20 21:09:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 21:09:33,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-20 21:09:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:33,287 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 21:09:33,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 21:09:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 21:09:33,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:33,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:33,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 21:09:33,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-20 21:09:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697149750] [2022-07-20 21:09:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697149750] [2022-07-20 21:09:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697149750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552736743] [2022-07-20 21:09:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:33,375 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-20 21:09:33,382 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-20 21:09:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:33,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:09:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:09:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552736743] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:09:33,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:09:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-20 21:09:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499606437] [2022-07-20 21:09:33,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:09:33,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 21:09:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:33,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 21:09:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:09:33,487 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:33,531 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-20 21:09:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 21:09:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:33,534 INFO L225 Difference]: With dead ends: 47 [2022-07-20 21:09:33,534 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 21:09:33,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:09:33,536 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:33,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 21:09:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 21:09:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-20 21:09:33,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 19 [2022-07-20 21:09:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:33,548 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-20 21:09:33,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-20 21:09:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 21:09:33,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:33,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:33,580 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-20 21:09:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:33,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:33,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1797589728, now seen corresponding path program 2 times [2022-07-20 21:09:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:33,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742256048] [2022-07-20 21:09:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:33,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742256048] [2022-07-20 21:09:33,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742256048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18104560] [2022-07-20 21:09:33,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:09:33,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:33,885 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-20 21:09:33,899 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-20 21:09:33,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:09:33,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:09:33,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 21:09:33,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:34,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:09:34,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18104560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:34,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 21:09:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-20 21:09:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638913997] [2022-07-20 21:09:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:34,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 21:09:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 21:09:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-20 21:09:34,072 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:34,109 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-20 21:09:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 21:09:34,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 21:09:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:34,110 INFO L225 Difference]: With dead ends: 53 [2022-07-20 21:09:34,110 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 21:09:34,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-20 21:09:34,112 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:34,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 21:09:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 21:09:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-20 21:09:34,123 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 25 [2022-07-20 21:09:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:34,123 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-20 21:09:34,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-20 21:09:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 21:09:34,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:34,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:34,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 21:09:34,339 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,SelfDestructingSolverStorable5 [2022-07-20 21:09:34,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1796312990, now seen corresponding path program 1 times [2022-07-20 21:09:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:34,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772984756] [2022-07-20 21:09:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772984756] [2022-07-20 21:09:34,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772984756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505798439] [2022-07-20 21:09:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:34,808 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-20 21:09:34,835 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-20 21:09:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:34,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 21:09:34,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:34,960 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 18 treesize of output 14 [2022-07-20 21:09:35,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:09:35,052 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 31 treesize of output 30 [2022-07-20 21:09:35,129 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-20 21:09:35,129 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 1 case distinctions, treesize of input 24 treesize of output 29 [2022-07-20 21:09:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:35,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:09:54,204 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 55 treesize of output 51 [2022-07-20 21:09:54,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 383 [2022-07-20 21:09:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 21:09:56,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505798439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:09:56,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:09:56,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2022-07-20 21:09:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749109447] [2022-07-20 21:09:56,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:09:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 21:09:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 21:09:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=890, Unknown=6, NotChecked=0, Total=1056 [2022-07-20 21:09:56,565 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:04,960 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 54 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 21:10:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:10:07,295 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-07-20 21:10:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 21:10:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 21:10:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:10:07,296 INFO L225 Difference]: With dead ends: 85 [2022-07-20 21:10:07,297 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 21:10:07,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=343, Invalid=1630, Unknown=7, NotChecked=0, Total=1980 [2022-07-20 21:10:07,299 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:10:07,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 314 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-07-20 21:10:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 21:10:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2022-07-20 21:10:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-20 21:10:07,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2022-07-20 21:10:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:10:07,307 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-20 21:10:07,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-20 21:10:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:10:07,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:10:07,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:10:07,334 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-20 21:10:07,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:07,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:10:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:10:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1325174645, now seen corresponding path program 1 times [2022-07-20 21:10:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:10:07,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560943041] [2022-07-20 21:10:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:10:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:10:07,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560943041] [2022-07-20 21:10:07,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560943041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:10:07,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786352990] [2022-07-20 21:10:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:07,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:10:07,850 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-20 21:10:07,866 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-20 21:10:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:07,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 21:10:07,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:10:08,007 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-20 21:10:08,058 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-20 21:10:08,058 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 1 case distinctions, treesize of input 26 treesize of output 31 [2022-07-20 21:10:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:08,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:10:10,932 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 39 treesize of output 35 [2022-07-20 21:10:10,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-07-20 21:10:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 21:10:11,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786352990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:10:11,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:10:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 31 [2022-07-20 21:10:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251049031] [2022-07-20 21:10:11,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:10:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 21:10:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:10:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 21:10:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-07-20 21:10:11,054 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:10:11,515 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-20 21:10:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 21:10:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 21:10:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:10:11,518 INFO L225 Difference]: With dead ends: 118 [2022-07-20 21:10:11,518 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 21:10:11,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 21:10:11,520 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:10:11,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 188 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2022-07-20 21:10:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 21:10:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2022-07-20 21:10:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-20 21:10:11,536 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 31 [2022-07-20 21:10:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:10:11,536 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-20 21:10:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-20 21:10:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:10:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:10:11,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:10:11,562 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-20 21:10:11,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:11,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:10:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:10:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash 932147635, now seen corresponding path program 1 times [2022-07-20 21:10:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:10:11,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443195835] [2022-07-20 21:10:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:10:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:10:12,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443195835] [2022-07-20 21:10:12,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443195835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:10:12,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511325587] [2022-07-20 21:10:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:12,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:10:12,012 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-20 21:10:12,038 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-20 21:10:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:12,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 21:10:12,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:10:12,113 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 18 treesize of output 14 [2022-07-20 21:10:12,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:10:12,172 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 31 treesize of output 30 [2022-07-20 21:10:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:10:12,218 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 24 treesize of output 23 [2022-07-20 21:10:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:12,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:10:30,676 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 38 treesize of output 36 [2022-07-20 21:10:30,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 880 treesize of output 872 [2022-07-20 21:10:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511325587] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:10:30,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:10:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-07-20 21:10:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149485408] [2022-07-20 21:10:30,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:10:30,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 21:10:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:10:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 21:10:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=729, Unknown=10, NotChecked=0, Total=870 [2022-07-20 21:10:30,765 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:10:31,413 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2022-07-20 21:10:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 21:10:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 21:10:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:10:31,418 INFO L225 Difference]: With dead ends: 136 [2022-07-20 21:10:31,421 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 21:10:31,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=335, Invalid=1725, Unknown=10, NotChecked=0, Total=2070 [2022-07-20 21:10:31,423 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 190 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:10:31,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 183 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 386 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-07-20 21:10:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 21:10:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 80. [2022-07-20 21:10:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2022-07-20 21:10:31,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 31 [2022-07-20 21:10:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:10:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2022-07-20 21:10:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-07-20 21:10:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 21:10:31,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:10:31,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:10:31,479 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-20 21:10:31,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:31,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:10:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:10:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1798450104, now seen corresponding path program 2 times [2022-07-20 21:10:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:10:31,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228610409] [2022-07-20 21:10:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:10:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:10:31,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228610409] [2022-07-20 21:10:31,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228610409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:10:31,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734319238] [2022-07-20 21:10:31,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:10:31,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:10:31,873 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-20 21:10:31,875 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-20 21:10:31,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:10:31,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:10:31,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 21:10:31,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:10:31,981 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-20 21:10:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:32,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:10:32,150 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 19 treesize of output 17 [2022-07-20 21:10:32,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-20 21:10:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734319238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:10:32,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:10:32,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-07-20 21:10:32,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290331718] [2022-07-20 21:10:32,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:10:32,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 21:10:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:10:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 21:10:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-20 21:10:32,303 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:10:33,573 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2022-07-20 21:10:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-07-20 21:10:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 21:10:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:10:33,575 INFO L225 Difference]: With dead ends: 264 [2022-07-20 21:10:33,575 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 21:10:33,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=921, Invalid=4481, Unknown=0, NotChecked=0, Total=5402 [2022-07-20 21:10:33,577 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 268 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:10:33,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 218 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 21:10:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 21:10:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 119. [2022-07-20 21:10:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-07-20 21:10:33,601 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 37 [2022-07-20 21:10:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:10:33,601 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-07-20 21:10:33,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-07-20 21:10:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:10:33,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:10:33,603 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:10:33,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 21:10:33,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:33,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:10:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:10:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 996077275, now seen corresponding path program 3 times [2022-07-20 21:10:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:10:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840004079] [2022-07-20 21:10:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:10:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 21:10:34,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:10:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840004079] [2022-07-20 21:10:34,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840004079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:10:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188152056] [2022-07-20 21:10:34,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:10:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:10:34,052 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-20 21:10:34,079 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-20 21:10:34,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 21:10:34,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:10:34,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 21:10:34,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:10:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 21:10:34,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:10:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 21:10:34,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188152056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:10:34,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:10:34,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-07-20 21:10:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937419645] [2022-07-20 21:10:34,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:10:34,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 21:10:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:10:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 21:10:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-07-20 21:10:34,658 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:10:34,889 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2022-07-20 21:10:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 21:10:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-20 21:10:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:10:34,890 INFO L225 Difference]: With dead ends: 182 [2022-07-20 21:10:34,890 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 21:10:34,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 21:10:34,892 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 239 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:10:34,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 165 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:10:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 21:10:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2022-07-20 21:10:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.238532110091743) internal successors, (135), 109 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-07-20 21:10:34,933 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 43 [2022-07-20 21:10:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:10:34,933 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-07-20 21:10:34,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:10:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-07-20 21:10:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:10:34,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:10:34,937 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:10:34,954 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-20 21:10:35,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:35,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:10:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:10:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -218220002, now seen corresponding path program 4 times [2022-07-20 21:10:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:10:35,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386008793] [2022-07-20 21:10:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:10:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:10:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:10:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:10:35,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386008793] [2022-07-20 21:10:35,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386008793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:10:35,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442310872] [2022-07-20 21:10:35,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:10:35,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:10:35,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:10:35,709 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-20 21:10:35,740 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-20 21:10:35,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:10:35,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:10:35,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 21:10:35,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:10:35,894 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-20 21:10:35,952 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-20 21:10:35,952 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 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-20 21:10:36,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:10:36,181 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-20 21:10:36,181 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 2 case distinctions, treesize of input 46 treesize of output 62 [2022-07-20 21:10:36,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:10:36,293 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 38 treesize of output 31 [2022-07-20 21:10:36,363 INFO L356 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-07-20 21:10:36,363 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 1 case distinctions, treesize of input 38 treesize of output 41 [2022-07-20 21:10:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:10:50,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:00,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))))) is different from false [2022-07-20 21:12:36,717 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 99 treesize of output 95 [2022-07-20 21:12:36,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1927 treesize of output 1911 [2022-07-20 21:12:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 58 refuted. 4 times theorem prover too weak. 2 trivial. 2 not checked. [2022-07-20 21:12:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442310872] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:39,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:12:39,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 51 [2022-07-20 21:12:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803765380] [2022-07-20 21:12:39,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 21:12:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:12:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 21:12:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2049, Unknown=76, NotChecked=96, Total=2550 [2022-07-20 21:12:39,859 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:02,319 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))))) (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (<= 2 (select .cse2 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (= 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= (select .cse2 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4))) is different from false [2022-07-20 21:13:14,446 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse1 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_164) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse1 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3))))))) is different from false [2022-07-20 21:13:16,450 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))))) (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (<= 2 (select .cse2 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (= 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= (select .cse2 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4))) (or (= .cse3 0) (<= 2 .cse3))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2)) is different from false [2022-07-20 21:13:23,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse4 (select .cse1 4))) (let ((.cse5 (<= 2 .cse4))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int) (|v_ULTIMATE.start_main_~j~0#1_49| Int) (|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse2 (select (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 0) (+ .cse3 (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_164) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (= .cse2 0)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (or (= .cse4 0) .cse5) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or .cse5 (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 4)) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))))) is different from false [2022-07-20 21:13:25,336 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse1 (select (let ((.cse2 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse1 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1))))))) is different from false [2022-07-20 21:13:27,340 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse1 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_164) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse1 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)))))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0)))) is different from false [2022-07-20 21:13:33,405 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)))))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)))) (and (= (select .cse2 .cse3) 0) (= .cse3 4))) (<= 2 (select .cse2 4))))) is different from false [2022-07-20 21:13:35,428 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4))) (or (= .cse0 0) (<= 2 .cse0))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse1 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_164) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse1 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3))))))) is different from false [2022-07-20 21:13:38,826 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse2 (select (let ((.cse3 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select .cse1 4)) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))) is different from false [2022-07-20 21:13:59,755 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_49| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_49| 3)) (forall ((v_ArrVal_166 Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int)) (let ((.cse1 (select (let ((.cse2 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_49| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |v_ULTIMATE.start_main_~j~0#1_49|)) (= .cse1 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0)))) is different from false [2022-07-20 21:14:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:14:10,685 INFO L93 Difference]: Finished difference Result 252 states and 311 transitions. [2022-07-20 21:14:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-20 21:14:10,686 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-20 21:14:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:14:10,687 INFO L225 Difference]: With dead ends: 252 [2022-07-20 21:14:10,687 INFO L226 Difference]: Without dead ends: 250 [2022-07-20 21:14:10,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 213.0s TimeCoverageRelationStatistics Valid=642, Invalid=3706, Unknown=118, NotChecked=1540, Total=6006 [2022-07-20 21:14:10,688 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:14:10,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 256 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 257 Invalid, 0 Unknown, 327 Unchecked, 0.2s Time] [2022-07-20 21:14:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-20 21:14:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 165. [2022-07-20 21:14:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:14:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2022-07-20 21:14:10,712 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 43 [2022-07-20 21:14:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:14:10,712 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2022-07-20 21:14:10,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:14:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2022-07-20 21:14:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:14:10,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:14:10,713 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:14:10,731 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-20 21:14:10,919 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,SelfDestructingSolverStorable11 [2022-07-20 21:14:10,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:14:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:14:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -611247012, now seen corresponding path program 2 times [2022-07-20 21:14:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:14:10,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67428114] [2022-07-20 21:14:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:14:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:14:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:14:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 21:14:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:14:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67428114] [2022-07-20 21:14:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67428114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:14:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547988463] [2022-07-20 21:14:11,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:14:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:14:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:14:11,270 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-20 21:14:11,271 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-20 21:14:11,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:14:11,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:14:11,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 21:14:11,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:14:11,411 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-20 21:14:11,458 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-20 21:14:11,458 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 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-20 21:14:11,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:14:11,633 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-20 21:14:11,634 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 2 case distinctions, treesize of input 46 treesize of output 62 [2022-07-20 21:14:11,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:14:11,722 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 38 treesize of output 31 [2022-07-20 21:14:11,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:14:11,781 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 38 treesize of output 31 [2022-07-20 21:14:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:14:12,057 INFO L328 TraceCheckSpWp]: Computing backward predicates...