./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s2lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s2lif.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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:29:03,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:29:03,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:29:03,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:29:03,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:29:03,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:29:03,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:29:03,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:29:03,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:29:03,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:29:03,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:29:03,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:29:03,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:29:03,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:29:03,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:29:03,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:29:03,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:29:03,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:29:03,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:29:03,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:29:03,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:29:03,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:29:03,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:29:03,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:29:03,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:29:03,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:29:03,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:29:03,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:29:03,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:29:03,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:29:03,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:29:03,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:29:03,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:29:03,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:29:03,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:29:03,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:29:03,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:29:03,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:29:03,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:29:03,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:29:03,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:29:03,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:29:03,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:29:03,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:29:03,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:29:03,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:29:03,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:29:03,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:29:03,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:29:03,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:29:03,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:29:03,253 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:29:03,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:29:03,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:29:03,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:29:03,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:29:03,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:29:03,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:29:03,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:29:03,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:29:03,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:29:03,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:29:03,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:29:03,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:29:03,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:29:03,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:29:03,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:29:03,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:29:03,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:29:03,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:29:03,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:29:03,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:29:03,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:29:03,258 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:29:03,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:29:03,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:29:03,259 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-07-11 23:29:03,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:29:03,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:29:03,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:29:03,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:29:03,503 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:29:03,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s2lif.c [2022-07-11 23:29:03,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97faafdfa/212e3e85ca6644e99e3ae5353db8facd/FLAG380378314 [2022-07-11 23:29:03,938 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:29:03,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s2lif.c [2022-07-11 23:29:03,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97faafdfa/212e3e85ca6644e99e3ae5353db8facd/FLAG380378314 [2022-07-11 23:29:04,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97faafdfa/212e3e85ca6644e99e3ae5353db8facd [2022-07-11 23:29:04,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:29:04,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:29:04,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:29:04,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:29:04,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:29:04,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fce6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04, skipping insertion in model container [2022-07-11 23:29:04,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:29:04,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:29:04,538 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-fpi/s2lif.c[588,601] [2022-07-11 23:29:04,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:29:04,578 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:29:04,591 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-fpi/s2lif.c[588,601] [2022-07-11 23:29:04,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:29:04,623 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:29:04,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04 WrapperNode [2022-07-11 23:29:04,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:29:04,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:29:04,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:29:04,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:29:04,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,666 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-11 23:29:04,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:29:04,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:29:04,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:29:04,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:29:04,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:29:04,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:29:04,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:29:04,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:29:04,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (1/1) ... [2022-07-11 23:29:04,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:29:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:04,736 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-11 23:29:04,746 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-11 23:29:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:29:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:29:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:29:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:29:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:29:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:29:04,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:29:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:29:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:29:04,836 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:29:04,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:29:05,030 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:29:05,035 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:29:05,035 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:29:05,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:29:05 BoogieIcfgContainer [2022-07-11 23:29:05,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:29:05,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:29:05,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:29:05,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:29:05,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:29:04" (1/3) ... [2022-07-11 23:29:05,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4510d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:29:05, skipping insertion in model container [2022-07-11 23:29:05,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:29:04" (2/3) ... [2022-07-11 23:29:05,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4510d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:29:05, skipping insertion in model container [2022-07-11 23:29:05,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:29:05" (3/3) ... [2022-07-11 23:29:05,062 INFO L111 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-07-11 23:29:05,074 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:29:05,075 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:29:05,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:29:05,136 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@1333254c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7de9297d [2022-07-11 23:29:05,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:29:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-11 23:29:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:29:05,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:05,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:05,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-11 23:29:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:05,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773559166] [2022-07-11 23:29:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:05,307 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-11 23:29:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:05,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773559166] [2022-07-11 23:29:05,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773559166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:29:05,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:29:05,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:29:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000742200] [2022-07-11 23:29:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:29:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:29:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:29:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:29:05,353 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-11 23:29:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:05,368 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-11 23:29:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:29:05,370 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-11 23:29:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:05,377 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:29:05,377 INFO L226 Difference]: Without dead ends: 18 [2022-07-11 23:29:05,379 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-11 23:29:05,382 INFO L413 NwaCegarLoop]: 26 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, 26 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-11 23:29:05,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:29:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-11 23:29:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-11 23:29:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11 23:29:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-11 23:29:05,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-11 23:29:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:05,408 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-11 23:29:05,409 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-11 23:29:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-11 23:29:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:29:05,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:05,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:05,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:29:05,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-11 23:29:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:05,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735983410] [2022-07-11 23:29:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:05,501 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-11 23:29:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735983410] [2022-07-11 23:29:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735983410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:29:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:29:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:29:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352397377] [2022-07-11 23:29:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:29:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:29:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:29:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:29:05,507 INFO L87 Difference]: Start difference. First operand 18 states and 21 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-11 23:29:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:05,574 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-11 23:29:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:29:05,574 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-11 23:29:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:05,576 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:29:05,576 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 23:29:05,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:29:05,580 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:05,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:29:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 23:29:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-11 23:29:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-11 23:29:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-11 23:29:05,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-11 23:29:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:05,592 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-11 23:29:05,594 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-11 23:29:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-11 23:29:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:29:05,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:05,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:05,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:29:05,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-11 23:29:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:05,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444035299] [2022-07-11 23:29:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:06,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444035299] [2022-07-11 23:29:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444035299] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241029540] [2022-07-11 23:29:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:06,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:06,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:06,147 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-11 23:29:06,152 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-11 23:29:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:06,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:29:06,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:06,283 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 10 treesize of output 8 [2022-07-11 23:29:06,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:29:06,330 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 14 treesize of output 16 [2022-07-11 23:29:06,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-07-11 23:29:06,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-07-11 23:29:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:06,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:06,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:29:06,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-11 23:29:06,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:29:06,993 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-11 23:29:06,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:07,001 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 22 treesize of output 14 [2022-07-11 23:29:07,017 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 16 treesize of output 12 [2022-07-11 23:29:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:07,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241029540] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:07,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:07,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-07-11 23:29:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386208547] [2022-07-11 23:29:07,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:07,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 23:29:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 23:29:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:29:07,033 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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-11 23:29:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:07,752 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-07-11 23:29:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:29:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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 20 [2022-07-11 23:29:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:07,754 INFO L225 Difference]: With dead ends: 61 [2022-07-11 23:29:07,755 INFO L226 Difference]: Without dead ends: 56 [2022-07-11 23:29:07,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=1324, Unknown=0, NotChecked=0, Total=1640 [2022-07-11 23:29:07,756 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:07,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 65 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 232 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-11 23:29:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-11 23:29:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2022-07-11 23:29:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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-11 23:29:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-11 23:29:07,774 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-07-11 23:29:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:07,775 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-11 23:29:07,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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-11 23:29:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-11 23:29:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:29:07,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:07,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:07,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:07,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:07,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-11 23:29:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:07,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71745260] [2022-07-11 23:29:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:08,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71745260] [2022-07-11 23:29:08,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71745260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:08,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721481765] [2022-07-11 23:29:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:08,120 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-11 23:29:08,152 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-11 23:29:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:08,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:29:08,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:08,185 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-11 23:29:08,207 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 15 treesize of output 7 [2022-07-11 23:29:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:08,233 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 14 treesize of output 12 [2022-07-11 23:29:08,235 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 22 treesize of output 20 [2022-07-11 23:29:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721481765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:08,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:08,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-11 23:29:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524619809] [2022-07-11 23:29:08,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:08,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:29:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:29:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:29:08,246 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11 23:29:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:08,324 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-07-11 23:29:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:29:08,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2022-07-11 23:29:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:08,326 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:29:08,326 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:29:08,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:29:08,327 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:08,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:29:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:29:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-11 23:29:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-11 23:29:08,334 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-07-11 23:29:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:08,335 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-11 23:29:08,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11 23:29:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-11 23:29:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:29:08,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:08,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:08,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:08,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:29:08,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-11 23:29:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:08,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343740161] [2022-07-11 23:29:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343740161] [2022-07-11 23:29:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343740161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595882196] [2022-07-11 23:29:08,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:29:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:08,629 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-11 23:29:08,658 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-11 23:29:08,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:29:08,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:08,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:29:08,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595882196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:08,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:29:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736497110] [2022-07-11 23:29:08,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:29:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:08,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:29:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:29:08,751 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-11 23:29:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:08,840 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-11 23:29:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:29:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 22 [2022-07-11 23:29:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:08,841 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:29:08,841 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 23:29:08,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:29:08,845 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:08,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 28 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 23:29:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-11 23:29:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-11 23:29:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-11 23:29:08,866 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-11 23:29:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:08,867 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-11 23:29:08,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-11 23:29:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-11 23:29:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:29:08,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:08,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:08,893 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-11 23:29:09,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:09,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-11 23:29:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:09,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292414550] [2022-07-11 23:29:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:09,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292414550] [2022-07-11 23:29:09,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292414550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63957814] [2022-07-11 23:29:09,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:29:09,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:09,164 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-11 23:29:09,185 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-11 23:29:09,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:29:09,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:09,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:29:09,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:09,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:29:09,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63957814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:09,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:09,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:29:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495774005] [2022-07-11 23:29:09,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:09,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:29:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:29:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:29:09,318 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11 23:29:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:09,403 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-11 23:29:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:29:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 22 [2022-07-11 23:29:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:09,405 INFO L225 Difference]: With dead ends: 39 [2022-07-11 23:29:09,405 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 23:29:09,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:29:09,406 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:09,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 23:29:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-11 23:29:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-11 23:29:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-11 23:29:09,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-11 23:29:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:09,411 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-11 23:29:09,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11 23:29:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-11 23:29:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:29:09,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:09,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:09,439 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-11 23:29:09,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:09,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-11 23:29:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:09,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947044184] [2022-07-11 23:29:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:10,376 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-11 23:29:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:10,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947044184] [2022-07-11 23:29:10,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947044184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:10,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100740757] [2022-07-11 23:29:10,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:29:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:10,380 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-11 23:29:10,411 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-11 23:29:10,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:29:10,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:10,435 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:29:10,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:10,449 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 11 treesize of output 7 [2022-07-11 23:29:10,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:10,479 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 14 treesize of output 16 [2022-07-11 23:29:10,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:10,519 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 14 treesize of output 16 [2022-07-11 23:29:10,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:10,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:29:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:10,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:10,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-11 23:29:11,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:11,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-11 23:29:11,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:11,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-11 23:29:11,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:11,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2022-07-11 23:29:11,236 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-11 23:29:11,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:12,020 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-11 23:29:12,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-11 23:29:12,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 2) .cse0) 1)) (not (= (+ (- 2) (select v_arrayElimArr_3 .cse1)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 3 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse4))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:29:12,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 2) .cse0) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 2) (select v_arrayElimArr_3 .cse1)) 1)) (= (* 3 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse4)))))))) is different from false [2022-07-11 23:29:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-11 23:29:12,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100740757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:12,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:12,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2022-07-11 23:29:12,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673283438] [2022-07-11 23:29:12,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:12,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-11 23:29:12,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-11 23:29:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1917, Unknown=2, NotChecked=186, Total=2450 [2022-07-11 23:29:12,097 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-11 23:29:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:15,025 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2022-07-11 23:29:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-11 23:29:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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 27 [2022-07-11 23:29:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:15,026 INFO L225 Difference]: With dead ends: 75 [2022-07-11 23:29:15,026 INFO L226 Difference]: Without dead ends: 70 [2022-07-11 23:29:15,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=917, Invalid=4491, Unknown=2, NotChecked=290, Total=5700 [2022-07-11 23:29:15,029 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:15,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 90 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 546 Invalid, 0 Unknown, 86 Unchecked, 0.7s Time] [2022-07-11 23:29:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-11 23:29:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2022-07-11 23:29:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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-11 23:29:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-11 23:29:15,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-07-11 23:29:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:15,039 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-11 23:29:15,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-11 23:29:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-11 23:29:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:29:15,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:15,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:15,064 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-11 23:29:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:15,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-11 23:29:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:15,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944685629] [2022-07-11 23:29:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:29:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:15,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944685629] [2022-07-11 23:29:15,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944685629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:15,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448830131] [2022-07-11 23:29:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:15,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:15,412 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-11 23:29:15,442 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-11 23:29:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:15,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-11 23:29:15,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:15,484 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 13 treesize of output 9 [2022-07-11 23:29:15,514 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:29:15,514 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 25 treesize of output 24 [2022-07-11 23:29:15,534 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 7 [2022-07-11 23:29:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:29:15,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:15,582 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 16 treesize of output 14 [2022-07-11 23:29:15,584 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 28 treesize of output 24 [2022-07-11 23:29:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:29:15,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448830131] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:15,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:15,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-11 23:29:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625086160] [2022-07-11 23:29:15,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:15,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:29:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:15,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:29:15,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:29:15,597 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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-11 23:29:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:15,795 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-11 23:29:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:29:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 27 [2022-07-11 23:29:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:15,796 INFO L225 Difference]: With dead ends: 63 [2022-07-11 23:29:15,796 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:29:15,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:29:15,797 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:15,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:29:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-11 23:29:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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-11 23:29:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-11 23:29:15,807 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-07-11 23:29:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:15,808 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-11 23:29:15,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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-11 23:29:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-11 23:29:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:29:15,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:15,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:15,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:16,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:16,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-11 23:29:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:16,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050357513] [2022-07-11 23:29:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:29:16,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:16,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050357513] [2022-07-11 23:29:16,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050357513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:16,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458952485] [2022-07-11 23:29:16,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:29:16,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:16,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:16,108 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-11 23:29:16,138 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-11 23:29:16,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:29:16,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:16,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:29:16,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:29:16,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:29:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458952485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:16,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:29:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223905258] [2022-07-11 23:29:16,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:29:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:29:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:29:16,275 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-11 23:29:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:16,383 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-11 23:29:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:29:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 29 [2022-07-11 23:29:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:16,384 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:29:16,384 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:29:16,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:29:16,385 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:16,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:29:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-11 23:29:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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-11 23:29:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-11 23:29:16,390 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-11 23:29:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:16,391 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-11 23:29:16,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-11 23:29:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-11 23:29:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:29:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:16,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:16,409 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-11 23:29:16,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:16,600 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-11 23:29:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:16,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024823079] [2022-07-11 23:29:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:29:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024823079] [2022-07-11 23:29:16,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024823079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:16,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299760358] [2022-07-11 23:29:16,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:29:16,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:16,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:16,691 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-11 23:29:16,720 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-11 23:29:16,760 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:29:16,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:16,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:29:16,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:16,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299760358] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:16,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:29:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103619344] [2022-07-11 23:29:16,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:16,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:29:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:29:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:29:16,838 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-11 23:29:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:16,949 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-11 23:29:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:29:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 32 [2022-07-11 23:29:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:16,951 INFO L225 Difference]: With dead ends: 42 [2022-07-11 23:29:16,951 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:29:16,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:29:16,952 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:16,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 26 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:29:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:29:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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-11 23:29:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-11 23:29:16,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-11 23:29:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:16,959 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-11 23:29:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-11 23:29:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-11 23:29:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:29:16,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:16,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:16,977 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-11 23:29:17,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:29:17,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-11 23:29:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420255930] [2022-07-11 23:29:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:18,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420255930] [2022-07-11 23:29:18,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420255930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:18,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247173501] [2022-07-11 23:29:18,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:29:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:18,348 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-11 23:29:18,376 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-11 23:29:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:18,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-11 23:29:18,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:18,436 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 10 treesize of output 8 [2022-07-11 23:29:18,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:29:18,465 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 14 treesize of output 16 [2022-07-11 23:29:18,497 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 14 treesize of output 16 [2022-07-11 23:29:18,532 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 14 treesize of output 16 [2022-07-11 23:29:18,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:29:18,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:18,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-11 23:29:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:18,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-07-11 23:29:19,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-07-11 23:29:19,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:19,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2022-07-11 23:29:19,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-07-11 23:29:19,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2022-07-11 23:29:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:19,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:21,560 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-11 23:29:21,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-11 23:29:21,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (select v_arrayElimArr_4 .cse0) 3)) (= (* 3 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ 3 .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse5)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:29:21,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (select v_arrayElimArr_4 .cse0) 3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (* 3 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ 3 .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse5)) 1))))) is different from false [2022-07-11 23:29:21,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (select v_arrayElimArr_4 .cse0) 3)) (= (* 3 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ 3 .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse5)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:29:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-11 23:29:21,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247173501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:21,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:21,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-11 23:29:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472709863] [2022-07-11 23:29:21,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:21,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-11 23:29:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-11 23:29:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=3515, Unknown=3, NotChecked=378, Total=4422 [2022-07-11 23:29:21,706 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11 23:29:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:29,279 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-07-11 23:29:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-11 23:29:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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 34 [2022-07-11 23:29:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:29,280 INFO L225 Difference]: With dead ends: 99 [2022-07-11 23:29:29,281 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:29:29,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1059, Invalid=8070, Unknown=3, NotChecked=570, Total=9702 [2022-07-11 23:29:29,283 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 103 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:29,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 118 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 996 Invalid, 0 Unknown, 185 Unchecked, 1.1s Time] [2022-07-11 23:29:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:29:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-11 23:29:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 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-11 23:29:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-11 23:29:29,294 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-11 23:29:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:29,294 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-11 23:29:29,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11 23:29:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-11 23:29:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:29:29,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:29,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:29,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:29,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-11 23:29:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:29,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640476498] [2022-07-11 23:29:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:29,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640476498] [2022-07-11 23:29:29,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640476498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:29,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148665795] [2022-07-11 23:29:29,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:29:29,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:29,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:29,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:29:29,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:29:29,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:29,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:29:29,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:29,753 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 13 treesize of output 9 [2022-07-11 23:29:29,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:29,792 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 25 treesize of output 24 [2022-07-11 23:29:29,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:29,834 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 25 treesize of output 24 [2022-07-11 23:29:29,857 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 15 treesize of output 7 [2022-07-11 23:29:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:29,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:29,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 16 treesize of output 14 [2022-07-11 23:29:29,934 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 28 treesize of output 24 [2022-07-11 23:29:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148665795] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:29,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:29,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-11 23:29:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880033254] [2022-07-11 23:29:29,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:29,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:29:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:29:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:29:29,971 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-11 23:29:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:30,333 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-11 23:29:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 23:29:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 34 [2022-07-11 23:29:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:30,334 INFO L225 Difference]: With dead ends: 76 [2022-07-11 23:29:30,334 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:29:30,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:29:30,336 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:30,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 80 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:29:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:29:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-11 23:29:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 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-11 23:29:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-11 23:29:30,352 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-11 23:29:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:30,352 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-11 23:29:30,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-11 23:29:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-11 23:29:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:29:30,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:30,353 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:30,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-11 23:29:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 23:29:30,555 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-11 23:29:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:30,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592337121] [2022-07-11 23:29:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:29:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:30,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592337121] [2022-07-11 23:29:30,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592337121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:30,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160778011] [2022-07-11 23:29:30,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:29:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:30,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:30,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:29:30,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:29:30,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:30,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:29:30,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:29:30,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:29:30,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160778011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:30,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:30,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:29:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804955633] [2022-07-11 23:29:30,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:30,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:29:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:29:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:29:30,824 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-11 23:29:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:30,966 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-11 23:29:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:29:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 36 [2022-07-11 23:29:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:30,967 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:29:30,967 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:29:30,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:29:30,971 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:30,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 31 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:29:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-11 23:29:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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-11 23:29:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-11 23:29:30,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-11 23:29:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:30,985 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-11 23:29:30,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-11 23:29:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-11 23:29:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:29:30,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:30,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:31,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-11 23:29:31,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 23:29:31,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-11 23:29:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92557160] [2022-07-11 23:29:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:29:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92557160] [2022-07-11 23:29:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92557160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215344052] [2022-07-11 23:29:31,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:29:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:31,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:31,304 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:31,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:29:31,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:29:31,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:31,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:29:31,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:29:31,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:29:31,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215344052] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:31,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:31,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:29:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142343369] [2022-07-11 23:29:31,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:31,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:29:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:29:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:29:31,534 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-11 23:29:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:31,748 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-11 23:29:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:29:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 39 [2022-07-11 23:29:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:31,750 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:29:31,750 INFO L226 Difference]: Without dead ends: 45 [2022-07-11 23:29:31,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:29:31,752 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:31,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 30 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-11 23:29:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-11 23:29:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-11 23:29:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-11 23:29:31,763 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-11 23:29:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:31,763 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-11 23:29:31,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-11 23:29:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-11 23:29:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:29:31,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:31,765 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:31,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:31,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 23:29:31,983 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-11 23:29:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:31,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147757943] [2022-07-11 23:29:31,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147757943] [2022-07-11 23:29:33,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147757943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811786523] [2022-07-11 23:29:33,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:29:33,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:33,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:33,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:33,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:29:33,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:29:33,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:33,750 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-11 23:29:33,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:33,764 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 11 treesize of output 7 [2022-07-11 23:29:33,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:33,800 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 14 treesize of output 16 [2022-07-11 23:29:33,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:33,850 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 14 treesize of output 16 [2022-07-11 23:29:33,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:33,909 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 14 treesize of output 16 [2022-07-11 23:29:33,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:33,955 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 14 treesize of output 16 [2022-07-11 23:29:34,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:29:34,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-11 23:29:34,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-11 23:29:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-07-11 23:29:34,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:34,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:34,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-07-11 23:29:35,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:35,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2022-07-11 23:29:35,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:35,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2022-07-11 23:29:35,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-07-11 23:29:35,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:35,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2022-07-11 23:29:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:35,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:42,188 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-11 23:29:42,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-11 23:29:42,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (+ (- 2) .cse2) 1)) (not (= (select v_arrayElimArr_5 .cse3) 3)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8)))))) (* 3 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:29:52,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (+ (- 2) .cse2) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_5 .cse3) 3)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8)))))) (* 3 ~N~0))))) is different from false [2022-07-11 23:29:53,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (+ (- 2) .cse2) 1)) (not (= (select v_arrayElimArr_5 .cse3) 3)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse2 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8)))))) (* 3 ~N~0))))) is different from false [2022-07-11 23:29:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-11 23:29:53,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811786523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:53,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:53,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 86 [2022-07-11 23:29:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298963643] [2022-07-11 23:29:53,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:53,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-11 23:29:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-11 23:29:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5955, Unknown=64, NotChecked=492, Total=7310 [2022-07-11 23:29:53,137 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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-11 23:30:41,452 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 207 DAG size of output: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:31:17,908 WARN L233 SmtUtils]: Spent 23.10s on a formula simplification. DAG size of input: 197 DAG size of output: 197 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:31:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:21,232 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-07-11 23:31:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-11 23:31:21,233 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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 41 [2022-07-11 23:31:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:21,233 INFO L225 Difference]: With dead ends: 113 [2022-07-11 23:31:21,233 INFO L226 Difference]: Without dead ends: 93 [2022-07-11 23:31:21,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5164 ImplicationChecksByTransitivity, 102.6s TimeCoverageRelationStatistics Valid=1471, Invalid=12496, Unknown=87, NotChecked=708, Total=14762 [2022-07-11 23:31:21,237 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:21,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 171 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1651 Invalid, 0 Unknown, 280 Unchecked, 4.1s Time] [2022-07-11 23:31:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-11 23:31:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2022-07-11 23:31:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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-11 23:31:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-11 23:31:21,251 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-11 23:31:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:21,252 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-11 23:31:21,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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-11 23:31:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-11 23:31:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:31:21,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:21,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:21,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-11 23:31:21,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 23:31:21,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-11 23:31:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:21,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776324936] [2022-07-11 23:31:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:21,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:31:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776324936] [2022-07-11 23:31:21,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776324936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940537574] [2022-07-11 23:31:21,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:21,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:21,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:31:21,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:31:21,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:21,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-11 23:31:21,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:22,018 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 15 treesize of output 11 [2022-07-11 23:31:22,209 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-11 23:31:22,210 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 27 treesize of output 26 [2022-07-11 23:31:22,311 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:31:22,312 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 27 treesize of output 34 [2022-07-11 23:31:22,420 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:31:22,420 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 40 treesize of output 47 [2022-07-11 23:31:22,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:22,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-11 23:31:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:31:22,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:07,325 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 25 treesize of output 23 [2022-07-11 23:32:07,330 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 210 treesize of output 198 [2022-07-11 23:32:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:32:07,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940537574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:07,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:07,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 17] total 48 [2022-07-11 23:32:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474628399] [2022-07-11 23:32:07,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-11 23:32:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-11 23:32:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1815, Unknown=14, NotChecked=0, Total=2256 [2022-07-11 23:32:07,347 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 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-11 23:32:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:15,510 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-11 23:32:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-11 23:32:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 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 41 [2022-07-11 23:32:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:15,510 INFO L225 Difference]: With dead ends: 96 [2022-07-11 23:32:15,510 INFO L226 Difference]: Without dead ends: 76 [2022-07-11 23:32:15,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=937, Invalid=4448, Unknown=17, NotChecked=0, Total=5402 [2022-07-11 23:32:15,512 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:15,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 64 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 274 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2022-07-11 23:32:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-11 23:32:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-07-11 23:32:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 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-11 23:32:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-11 23:32:15,526 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-11 23:32:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:15,527 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-11 23:32:15,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 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-11 23:32:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-11 23:32:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:32:15,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:15,528 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:15,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:15,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-11 23:32:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:15,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865507927] [2022-07-11 23:32:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:32:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865507927] [2022-07-11 23:32:15,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865507927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332686291] [2022-07-11 23:32:15,875 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:32:15,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:15,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:15,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:32:15,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:32:16,060 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 23:32:16,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:16,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:32:16,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:32:16,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:32:16,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332686291] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:16,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:16,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:32:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341286170] [2022-07-11 23:32:16,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:16,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:32:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:32:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:32:16,368 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11 23:32:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:16,615 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-11 23:32:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:32:16,615 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11 23:32:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:16,616 INFO L225 Difference]: With dead ends: 109 [2022-07-11 23:32:16,616 INFO L226 Difference]: Without dead ends: 62 [2022-07-11 23:32:16,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:32:16,617 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 110 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:16,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 38 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:32:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-11 23:32:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-11 23:32:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 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-11 23:32:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-11 23:32:16,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-11 23:32:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:16,629 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-11 23:32:16,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11 23:32:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-11 23:32:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:32:16,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:16,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:16,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:16,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-11 23:32:16,835 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-11 23:32:16,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:16,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472949194] [2022-07-11 23:32:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:32:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472949194] [2022-07-11 23:32:17,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472949194] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:17,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682785548] [2022-07-11 23:32:17,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:32:17,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:17,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:17,032 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:32:17,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 23:32:17,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-11 23:32:17,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:17,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:32:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:32:17,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:32:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682785548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:17,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:32:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301275531] [2022-07-11 23:32:17,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:17,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:32:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:32:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:32:17,494 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-11 23:32:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:17,855 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-11 23:32:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:32:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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 46 [2022-07-11 23:32:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:17,856 INFO L225 Difference]: With dead ends: 61 [2022-07-11 23:32:17,856 INFO L226 Difference]: Without dead ends: 57 [2022-07-11 23:32:17,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:32:17,857 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:17,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 24 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:32:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-11 23:32:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-11 23:32:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-11 23:32:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-11 23:32:17,865 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-11 23:32:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:17,865 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-11 23:32:17,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-11 23:32:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-11 23:32:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:32:17,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:17,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:17,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-11 23:32:18,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-11 23:32:18,066 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-11 23:32:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:18,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838893994] [2022-07-11 23:32:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:20,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838893994] [2022-07-11 23:32:20,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838893994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:20,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401609263] [2022-07-11 23:32:20,546 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:32:20,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:20,547 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:32:20,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 23:32:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:20,630 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-11 23:32:20,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:20,646 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 11 treesize of output 7 [2022-07-11 23:32:20,651 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 10 treesize of output 8 [2022-07-11 23:32:20,661 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 14 treesize of output 16 [2022-07-11 23:32:20,678 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 14 treesize of output 16 [2022-07-11 23:32:20,746 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 14 treesize of output 16 [2022-07-11 23:32:20,856 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 14 treesize of output 16 [2022-07-11 23:32:20,945 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 14 treesize of output 16 [2022-07-11 23:32:21,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:32:21,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:21,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-11 23:32:21,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:21,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:21,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:21,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2022-07-11 23:32:22,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-11 23:32:22,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-07-11 23:32:22,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:22,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2022-07-11 23:32:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:23,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2022-07-11 23:32:23,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2022-07-11 23:32:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:23,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2022-07-11 23:32:24,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-07-11 23:32:24,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2022-07-11 23:32:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:24,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:48,513 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-11 23:32:48,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 2897 treesize of output 549 [2022-07-11 23:32:48,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 3 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse3 .cse4 .cse5)))))))) (not (= (select v_arrayElimArr_6 .cse9) 3)) (not (= 3 (select v_arrayElimArr_6 .cse6))) (not (= 3 (select v_arrayElimArr_6 .cse8))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (not (= (+ (select v_arrayElimArr_6 .cse7) (- 2)) 1))))) is different from false [2022-07-11 23:32:48,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 3 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse3 .cse4 .cse5)))))))) (not (= (select v_arrayElimArr_6 .cse9) 3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 3 (select v_arrayElimArr_6 .cse6))) (not (= 3 (select v_arrayElimArr_6 .cse8))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (+ (select v_arrayElimArr_6 .cse7) (- 2)) 1))))) is different from false [2022-07-11 23:32:48,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 3 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse3 .cse4 .cse5)))))))) (not (= (select v_arrayElimArr_6 .cse9) 3)) (not (= 3 (select v_arrayElimArr_6 .cse6))) (not (= 3 (select v_arrayElimArr_6 .cse8))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (+ (select v_arrayElimArr_6 .cse7) (- 2)) 1))))) is different from false [2022-07-11 23:32:49,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 3 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse3 .cse4 .cse5)))))))) (not (= (select v_arrayElimArr_6 .cse9) 3)) (not (= 3 (select v_arrayElimArr_6 .cse6))) (not (= 3 (select v_arrayElimArr_6 .cse8))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (+ (select v_arrayElimArr_6 .cse7) (- 2)) 1))))) is different from false [2022-07-11 23:32:49,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 3 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 3 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse3 .cse4 .cse5)))))))) (not (= (select v_arrayElimArr_6 .cse9) 3)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= 3 (select v_arrayElimArr_6 .cse6))) (not (= 3 (select v_arrayElimArr_6 .cse8))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (+ (select v_arrayElimArr_6 .cse7) (- 2)) 1))))) is different from false [2022-07-11 23:32:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-11 23:32:49,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401609263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:49,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:49,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 102 [2022-07-11 23:32:49,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476916981] [2022-07-11 23:32:49,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:49,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-07-11 23:32:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:49,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-07-11 23:32:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=8316, Unknown=5, NotChecked=970, Total=10302 [2022-07-11 23:32:49,467 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 102 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 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)