./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f3090fd14639372da088dcbc149768c93516e312be941c28b3a0b4b80aaee842 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 00:10:50,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 00:10:50,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 00:10:50,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 00:10:50,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 00:10:50,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 00:10:50,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 00:10:50,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 00:10:50,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 00:10:50,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 00:10:50,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 00:10:50,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 00:10:50,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 00:10:50,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 00:10:50,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 00:10:50,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 00:10:50,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 00:10:50,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 00:10:50,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 00:10:50,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 00:10:50,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 00:10:50,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 00:10:50,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 00:10:50,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 00:10:50,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 00:10:50,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 00:10:50,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 00:10:50,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 00:10:50,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 00:10:50,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 00:10:50,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 00:10:50,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 00:10:50,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 00:10:50,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 00:10:50,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 00:10:50,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 00:10:50,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 00:10:50,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 00:10:50,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 00:10:50,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 00:10:50,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 00:10:50,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 00:10:50,223 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 00:10:50,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 00:10:50,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 00:10:50,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 00:10:50,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 00:10:50,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 00:10:50,225 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 00:10:50,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 00:10:50,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 00:10:50,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 00:10:50,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 00:10:50,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 00:10:50,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 00:10:50,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 00:10:50,228 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 00:10:50,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 00:10:50,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 00:10:50,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 00:10:50,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 00:10:50,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:10:50,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 00:10:50,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 00:10:50,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 00:10:50,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 00:10:50,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 00:10:50,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 00:10:50,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 00:10:50,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 00:10:50,230 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 00:10:50,231 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3090fd14639372da088dcbc149768c93516e312be941c28b3a0b4b80aaee842 [2021-11-04 00:10:50,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 00:10:50,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 00:10:50,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 00:10:50,473 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 00:10:50,475 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 00:10:50,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i [2021-11-04 00:10:50,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fc85d30/2bdf9b4564e44eec85a1d34d04dc822d/FLAG4f95e1f5b [2021-11-04 00:10:51,148 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 00:10:51,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i [2021-11-04 00:10:51,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fc85d30/2bdf9b4564e44eec85a1d34d04dc822d/FLAG4f95e1f5b [2021-11-04 00:10:51,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fc85d30/2bdf9b4564e44eec85a1d34d04dc822d [2021-11-04 00:10:51,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 00:10:51,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 00:10:51,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 00:10:51,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 00:10:51,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 00:10:51,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:10:51" (1/1) ... [2021-11-04 00:10:51,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd17357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:51, skipping insertion in model container [2021-11-04 00:10:51,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:10:51" (1/1) ... [2021-11-04 00:10:51,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 00:10:51,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 00:10:52,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i[159323,159336] [2021-11-04 00:10:52,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:10:52,520 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 00:10:52,697 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i[159323,159336] [2021-11-04 00:10:52,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:10:52,802 INFO L208 MainTranslator]: Completed translation [2021-11-04 00:10:52,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52 WrapperNode [2021-11-04 00:10:52,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 00:10:52,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 00:10:52,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 00:10:52,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 00:10:52,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:52,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:52,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 00:10:53,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 00:10:53,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 00:10:53,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 00:10:53,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 00:10:53,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 00:10:53,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 00:10:53,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 00:10:53,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (1/1) ... [2021-11-04 00:10:53,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:10:53,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:10:53,238 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) [2021-11-04 00:10:53,249 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 [2021-11-04 00:10:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 00:10:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 00:10:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 00:10:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 00:10:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 00:10:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 00:10:53,701 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,707 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,710 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,715 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,718 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,719 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:53,733 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:10:55,251 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##254: assume false; [2021-11-04 00:10:55,251 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##255: assume !false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume !false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##234: assume false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##447: assume !false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-11-04 00:10:55,252 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume !false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##115: assume false; [2021-11-04 00:10:55,253 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##116: assume !false; [2021-11-04 00:10:55,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 00:10:55,267 INFO L299 CfgBuilder]: Removed 509 assume(true) statements. [2021-11-04 00:10:55,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:10:55 BoogieIcfgContainer [2021-11-04 00:10:55,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 00:10:55,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 00:10:55,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 00:10:55,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 00:10:55,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:10:51" (1/3) ... [2021-11-04 00:10:55,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1846c17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:10:55, skipping insertion in model container [2021-11-04 00:10:55,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:10:52" (2/3) ... [2021-11-04 00:10:55,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1846c17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:10:55, skipping insertion in model container [2021-11-04 00:10:55,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:10:55" (3/3) ... [2021-11-04 00:10:55,278 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-misc-iowarrior.ko.cil.out.i [2021-11-04 00:10:55,282 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 00:10:55,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-04 00:10:55,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 00:10:55,367 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 00:10:55,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-04 00:10:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 562 states, 553 states have (on average 1.4990958408679929) internal successors, (829), 561 states have internal predecessors, (829), 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) [2021-11-04 00:10:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-04 00:10:55,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:55,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:10:55,400 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:10:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1571270776, now seen corresponding path program 1 times [2021-11-04 00:10:55,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:55,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147102678] [2021-11-04 00:10:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:55,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:55,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147102678] [2021-11-04 00:10:55,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147102678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:55,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:55,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:10:55,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880155704] [2021-11-04 00:10:55,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:55,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:10:55,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:10:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:10:55,889 INFO L87 Difference]: Start difference. First operand has 562 states, 553 states have (on average 1.4990958408679929) internal successors, (829), 561 states have internal predecessors, (829), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-04 00:10:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:58,182 INFO L93 Difference]: Finished difference Result 1644 states and 2443 transitions. [2021-11-04 00:10:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:10:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-04 00:10:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:58,199 INFO L225 Difference]: With dead ends: 1644 [2021-11-04 00:10:58,200 INFO L226 Difference]: Without dead ends: 1073 [2021-11-04 00:10:58,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.20ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:10:58,208 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 713 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1808.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.18ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2160.26ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:58,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 12 Invalid, 1447 Unknown, 0 Unchecked, 10.18ms Time], IncrementalHoareTripleChecker [6 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 2160.26ms Time] [2021-11-04 00:10:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-11-04 00:10:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1061. [2021-11-04 00:10:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1053 states have (on average 1.3371320037986705) internal successors, (1408), 1060 states have internal predecessors, (1408), 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) [2021-11-04 00:10:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1408 transitions. [2021-11-04 00:10:58,294 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1408 transitions. Word has length 9 [2021-11-04 00:10:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:58,295 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1408 transitions. [2021-11-04 00:10:58,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-04 00:10:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1408 transitions. [2021-11-04 00:10:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-04 00:10:58,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:58,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:10:58,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 00:10:58,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:10:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1464753323, now seen corresponding path program 1 times [2021-11-04 00:10:58,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:58,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264283442] [2021-11-04 00:10:58,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:58,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:58,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:58,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264283442] [2021-11-04 00:10:58,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264283442] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:58,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:58,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:10:58,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284539597] [2021-11-04 00:10:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:58,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:10:58,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:10:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:10:58,385 INFO L87 Difference]: Start difference. First operand 1061 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-04 00:11:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:00,343 INFO L93 Difference]: Finished difference Result 3165 states and 4205 transitions. [2021-11-04 00:11:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:11:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2021-11-04 00:11:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:00,351 INFO L225 Difference]: With dead ends: 3165 [2021-11-04 00:11:00,352 INFO L226 Difference]: Without dead ends: 2108 [2021-11-04 00:11:00,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.69ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:00,356 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 705 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1524.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.40ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1853.82ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:00,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 0 Invalid, 1429 Unknown, 0 Unchecked, 4.40ms Time], IncrementalHoareTripleChecker [1 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1853.82ms Time] [2021-11-04 00:11:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2021-11-04 00:11:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2088. [2021-11-04 00:11:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2080 states have (on average 1.3365384615384615) internal successors, (2780), 2087 states have internal predecessors, (2780), 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) [2021-11-04 00:11:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2780 transitions. [2021-11-04 00:11:00,429 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2780 transitions. Word has length 10 [2021-11-04 00:11:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:00,430 INFO L470 AbstractCegarLoop]: Abstraction has 2088 states and 2780 transitions. [2021-11-04 00:11:00,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-04 00:11:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2780 transitions. [2021-11-04 00:11:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 00:11:00,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:00,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:00,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 00:11:00,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 843509326, now seen corresponding path program 1 times [2021-11-04 00:11:00,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:00,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560848145] [2021-11-04 00:11:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:00,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:00,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:00,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560848145] [2021-11-04 00:11:00,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560848145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:00,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:00,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:00,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37520436] [2021-11-04 00:11:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:00,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:11:00,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:11:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:00,613 INFO L87 Difference]: Start difference. First operand 2088 states and 2780 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:11:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:02,529 INFO L93 Difference]: Finished difference Result 5166 states and 6898 transitions. [2021-11-04 00:11:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:11:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-04 00:11:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:02,541 INFO L225 Difference]: With dead ends: 5166 [2021-11-04 00:11:02,542 INFO L226 Difference]: Without dead ends: 3085 [2021-11-04 00:11:02,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.76ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:02,547 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1516.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.75ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1794.87ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:02,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 1407 Unknown, 0 Unchecked, 3.75ms Time], IncrementalHoareTripleChecker [7 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1794.87ms Time] [2021-11-04 00:11:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2021-11-04 00:11:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3068. [2021-11-04 00:11:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3060 states have (on average 1.3369281045751633) internal successors, (4091), 3067 states have internal predecessors, (4091), 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) [2021-11-04 00:11:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4091 transitions. [2021-11-04 00:11:02,627 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4091 transitions. Word has length 35 [2021-11-04 00:11:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:02,627 INFO L470 AbstractCegarLoop]: Abstraction has 3068 states and 4091 transitions. [2021-11-04 00:11:02,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:11:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4091 transitions. [2021-11-04 00:11:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-04 00:11:02,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:02,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:02,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 00:11:02,632 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1573275523, now seen corresponding path program 1 times [2021-11-04 00:11:02,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:02,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778777390] [2021-11-04 00:11:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:02,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:02,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:02,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778777390] [2021-11-04 00:11:02,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778777390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:02,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:02,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:02,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831322491] [2021-11-04 00:11:02,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:02,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:11:02,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:11:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:02,791 INFO L87 Difference]: Start difference. First operand 3068 states and 4091 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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) [2021-11-04 00:11:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:05,505 INFO L93 Difference]: Finished difference Result 8160 states and 10969 transitions. [2021-11-04 00:11:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:11:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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) Word has length 43 [2021-11-04 00:11:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:05,526 INFO L225 Difference]: With dead ends: 8160 [2021-11-04 00:11:05,527 INFO L226 Difference]: Without dead ends: 5097 [2021-11-04 00:11:05,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:05,534 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 659 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2281.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.18ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2596.63ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:05,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 0 Invalid, 1304 Unknown, 0 Unchecked, 3.18ms Time], IncrementalHoareTripleChecker [5 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 2596.63ms Time] [2021-11-04 00:11:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2021-11-04 00:11:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5074. [2021-11-04 00:11:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 5066 states have (on average 1.3509672325305961) internal successors, (6844), 5073 states have internal predecessors, (6844), 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) [2021-11-04 00:11:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 6844 transitions. [2021-11-04 00:11:05,697 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 6844 transitions. Word has length 43 [2021-11-04 00:11:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:05,697 INFO L470 AbstractCegarLoop]: Abstraction has 5074 states and 6844 transitions. [2021-11-04 00:11:05,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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) [2021-11-04 00:11:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 6844 transitions. [2021-11-04 00:11:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 00:11:05,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:05,702 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:05,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 00:11:05,703 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 250462999, now seen corresponding path program 1 times [2021-11-04 00:11:05,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:05,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465936872] [2021-11-04 00:11:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:05,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:05,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:05,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465936872] [2021-11-04 00:11:05,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465936872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:05,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:05,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:05,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414194687] [2021-11-04 00:11:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:05,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:11:05,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:11:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:05,836 INFO L87 Difference]: Start difference. First operand 5074 states and 6844 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2021-11-04 00:11:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:08,366 INFO L93 Difference]: Finished difference Result 13775 states and 18604 transitions. [2021-11-04 00:11:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:11:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-11-04 00:11:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:08,409 INFO L225 Difference]: With dead ends: 13775 [2021-11-04 00:11:08,409 INFO L226 Difference]: Without dead ends: 8708 [2021-11-04 00:11:08,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:08,424 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 460 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1948.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.33ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2332.62ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:08,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 0 Invalid, 2158 Unknown, 0 Unchecked, 5.33ms Time], IncrementalHoareTripleChecker [8 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 2332.62ms Time] [2021-11-04 00:11:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8708 states. [2021-11-04 00:11:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8708 to 8346. [2021-11-04 00:11:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8346 states, 8338 states have (on average 1.3644758934996402) internal successors, (11377), 8345 states have internal predecessors, (11377), 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) [2021-11-04 00:11:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8346 states to 8346 states and 11377 transitions. [2021-11-04 00:11:08,681 INFO L78 Accepts]: Start accepts. Automaton has 8346 states and 11377 transitions. Word has length 54 [2021-11-04 00:11:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:08,682 INFO L470 AbstractCegarLoop]: Abstraction has 8346 states and 11377 transitions. [2021-11-04 00:11:08,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2021-11-04 00:11:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8346 states and 11377 transitions. [2021-11-04 00:11:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 00:11:08,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:08,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:08,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 00:11:08,684 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1594904167, now seen corresponding path program 1 times [2021-11-04 00:11:08,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:08,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145221239] [2021-11-04 00:11:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:08,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:08,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:08,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145221239] [2021-11-04 00:11:08,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145221239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:08,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:08,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:11:08,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861082764] [2021-11-04 00:11:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:08,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:11:08,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:11:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:08,797 INFO L87 Difference]: Start difference. First operand 8346 states and 11377 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-11-04 00:11:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:11,113 INFO L93 Difference]: Finished difference Result 16728 states and 22801 transitions. [2021-11-04 00:11:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:11:11,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2021-11-04 00:11:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:11,150 INFO L225 Difference]: With dead ends: 16728 [2021-11-04 00:11:11,151 INFO L226 Difference]: Without dead ends: 8369 [2021-11-04 00:11:11,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.03ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:11,168 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1786.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.54ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2146.41ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:11,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 2156 Unknown, 0 Unchecked, 4.54ms Time], IncrementalHoareTripleChecker [1 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 2146.41ms Time] [2021-11-04 00:11:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2021-11-04 00:11:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 8313. [2021-11-04 00:11:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8313 states, 8305 states have (on average 1.3649608669476219) internal successors, (11336), 8312 states have internal predecessors, (11336), 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) [2021-11-04 00:11:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 11336 transitions. [2021-11-04 00:11:11,432 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 11336 transitions. Word has length 54 [2021-11-04 00:11:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:11,434 INFO L470 AbstractCegarLoop]: Abstraction has 8313 states and 11336 transitions. [2021-11-04 00:11:11,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-11-04 00:11:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 11336 transitions. [2021-11-04 00:11:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 00:11:11,438 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:11,438 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:11,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 00:11:11,438 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -133909066, now seen corresponding path program 1 times [2021-11-04 00:11:11,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:11,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140555205] [2021-11-04 00:11:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:11,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 00:11:11,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:11,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140555205] [2021-11-04 00:11:11,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140555205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:11,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:11,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-04 00:11:11,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363654858] [2021-11-04 00:11:11,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:11,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-04 00:11:11,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-04 00:11:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:11:11,686 INFO L87 Difference]: Start difference. First operand 8313 states and 11336 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2021-11-04 00:11:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:21,252 INFO L93 Difference]: Finished difference Result 40305 states and 54708 transitions. [2021-11-04 00:11:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-04 00:11:21,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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 65 [2021-11-04 00:11:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:21,322 INFO L225 Difference]: With dead ends: 40305 [2021-11-04 00:11:21,322 INFO L226 Difference]: Without dead ends: 31999 [2021-11-04 00:11:21,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 195.30ms TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2021-11-04 00:11:21,346 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5266 mSDsluCounter, 6465 mSDsCounter, 0 mSdLazyCounter, 9309 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7456.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.71ms SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 9309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8720.42ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:21,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5266 Valid, 0 Invalid, 9428 Unknown, 0 Unchecked, 30.71ms Time], IncrementalHoareTripleChecker [119 Valid, 9309 Invalid, 0 Unknown, 0 Unchecked, 8720.42ms Time] [2021-11-04 00:11:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31999 states. [2021-11-04 00:11:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31999 to 8313. [2021-11-04 00:11:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8313 states, 8305 states have (on average 1.3630343166767007) internal successors, (11320), 8312 states have internal predecessors, (11320), 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) [2021-11-04 00:11:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 11320 transitions. [2021-11-04 00:11:21,792 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 11320 transitions. Word has length 65 [2021-11-04 00:11:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:21,794 INFO L470 AbstractCegarLoop]: Abstraction has 8313 states and 11320 transitions. [2021-11-04 00:11:21,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2021-11-04 00:11:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 11320 transitions. [2021-11-04 00:11:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 00:11:21,796 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:21,796 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:21,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 00:11:21,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash -943255692, now seen corresponding path program 1 times [2021-11-04 00:11:21,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:21,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336097421] [2021-11-04 00:11:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:21,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:21,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:21,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336097421] [2021-11-04 00:11:21,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336097421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:21,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:21,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:21,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182000008] [2021-11-04 00:11:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:21,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:21,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:21,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:21,949 INFO L87 Difference]: Start difference. First operand 8313 states and 11320 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:24,690 INFO L93 Difference]: Finished difference Result 15053 states and 20457 transitions. [2021-11-04 00:11:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:11:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 65 [2021-11-04 00:11:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:24,703 INFO L225 Difference]: With dead ends: 15053 [2021-11-04 00:11:24,703 INFO L226 Difference]: Without dead ends: 6733 [2021-11-04 00:11:24,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.01ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:24,714 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2145.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.47ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2565.28ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:24,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 2764 Unknown, 0 Unchecked, 3.47ms Time], IncrementalHoareTripleChecker [1 Valid, 2763 Invalid, 0 Unknown, 0 Unchecked, 2565.28ms Time] [2021-11-04 00:11:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2021-11-04 00:11:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6588. [2021-11-04 00:11:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6580 states have (on average 1.3595744680851063) internal successors, (8946), 6587 states have internal predecessors, (8946), 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) [2021-11-04 00:11:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 8946 transitions. [2021-11-04 00:11:24,914 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 8946 transitions. Word has length 65 [2021-11-04 00:11:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:24,914 INFO L470 AbstractCegarLoop]: Abstraction has 6588 states and 8946 transitions. [2021-11-04 00:11:24,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 8946 transitions. [2021-11-04 00:11:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 00:11:24,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:24,917 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:24,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 00:11:24,917 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 164963298, now seen corresponding path program 1 times [2021-11-04 00:11:24,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:24,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194454826] [2021-11-04 00:11:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:24,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:25,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:25,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194454826] [2021-11-04 00:11:25,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194454826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:25,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:25,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:25,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419320887] [2021-11-04 00:11:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:25,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:25,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:25,034 INFO L87 Difference]: Start difference. First operand 6588 states and 8946 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:29,495 INFO L93 Difference]: Finished difference Result 19648 states and 26596 transitions. [2021-11-04 00:11:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:11:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 65 [2021-11-04 00:11:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:29,521 INFO L225 Difference]: With dead ends: 19648 [2021-11-04 00:11:29,521 INFO L226 Difference]: Without dead ends: 13058 [2021-11-04 00:11:29,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.36ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:29,536 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 707 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3552.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.55ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4157.07ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:29,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [707 Valid, 0 Invalid, 3119 Unknown, 0 Unchecked, 5.55ms Time], IncrementalHoareTripleChecker [11 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 4157.07ms Time] [2021-11-04 00:11:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2021-11-04 00:11:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 6597. [2021-11-04 00:11:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 6589 states have (on average 1.3586280163909545) internal successors, (8952), 6596 states have internal predecessors, (8952), 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) [2021-11-04 00:11:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 8952 transitions. [2021-11-04 00:11:29,807 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 8952 transitions. Word has length 65 [2021-11-04 00:11:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:29,808 INFO L470 AbstractCegarLoop]: Abstraction has 6597 states and 8952 transitions. [2021-11-04 00:11:29,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 8952 transitions. [2021-11-04 00:11:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 00:11:29,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:29,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:29,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 00:11:29,810 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2093236000, now seen corresponding path program 1 times [2021-11-04 00:11:29,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:29,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630336710] [2021-11-04 00:11:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:29,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:29,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:29,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630336710] [2021-11-04 00:11:29,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630336710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:29,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:29,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 00:11:29,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334877116] [2021-11-04 00:11:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:29,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:11:29,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:11:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:11:29,946 INFO L87 Difference]: Start difference. First operand 6597 states and 8952 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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) [2021-11-04 00:11:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:37,688 INFO L93 Difference]: Finished difference Result 28953 states and 39167 transitions. [2021-11-04 00:11:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-04 00:11:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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 65 [2021-11-04 00:11:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:37,724 INFO L225 Difference]: With dead ends: 28953 [2021-11-04 00:11:37,724 INFO L226 Difference]: Without dead ends: 22351 [2021-11-04 00:11:37,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 84.89ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-04 00:11:37,740 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3367 mSDsluCounter, 4902 mSDsCounter, 0 mSdLazyCounter, 6708 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6048.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.94ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7122.22ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:37,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3367 Valid, 0 Invalid, 6725 Unknown, 0 Unchecked, 14.94ms Time], IncrementalHoareTripleChecker [17 Valid, 6708 Invalid, 0 Unknown, 0 Unchecked, 7122.22ms Time] [2021-11-04 00:11:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22351 states. [2021-11-04 00:11:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22351 to 6609. [2021-11-04 00:11:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6609 states, 6601 states have (on average 1.3575215876382367) internal successors, (8961), 6608 states have internal predecessors, (8961), 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) [2021-11-04 00:11:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 8961 transitions. [2021-11-04 00:11:38,125 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 8961 transitions. Word has length 65 [2021-11-04 00:11:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:38,125 INFO L470 AbstractCegarLoop]: Abstraction has 6609 states and 8961 transitions. [2021-11-04 00:11:38,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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) [2021-11-04 00:11:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 8961 transitions. [2021-11-04 00:11:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 00:11:38,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:38,127 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:38,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 00:11:38,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1778084574, now seen corresponding path program 1 times [2021-11-04 00:11:38,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:38,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834851810] [2021-11-04 00:11:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:38,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:38,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:38,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834851810] [2021-11-04 00:11:38,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834851810] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:11:38,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081756789] [2021-11-04 00:11:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:38,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:11:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:11:38,331 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) [2021-11-04 00:11:38,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 00:11:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:38,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:11:38,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:11:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:38,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 00:11:38,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081756789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:38,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 00:11:38,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-04 00:11:38,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461814908] [2021-11-04 00:11:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:38,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:38,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:38,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:38,922 INFO L87 Difference]: Start difference. First operand 6609 states and 8961 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:41,611 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:44,446 INFO L93 Difference]: Finished difference Result 13293 states and 18004 transitions. [2021-11-04 00:11:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 65 [2021-11-04 00:11:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:44,454 INFO L225 Difference]: With dead ends: 13293 [2021-11-04 00:11:44,454 INFO L226 Difference]: Without dead ends: 6676 [2021-11-04 00:11:44,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.53ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:11:44,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4559.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.88ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5233.29ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:44,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 2887 Unknown, 0 Unchecked, 3.88ms Time], IncrementalHoareTripleChecker [2 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 5233.29ms Time] [2021-11-04 00:11:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2021-11-04 00:11:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6618. [2021-11-04 00:11:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6618 states, 6610 states have (on average 1.3565809379727685) internal successors, (8967), 6617 states have internal predecessors, (8967), 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) [2021-11-04 00:11:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 8967 transitions. [2021-11-04 00:11:44,736 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 8967 transitions. Word has length 65 [2021-11-04 00:11:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:44,736 INFO L470 AbstractCegarLoop]: Abstraction has 6618 states and 8967 transitions. [2021-11-04 00:11:44,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) [2021-11-04 00:11:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 8967 transitions. [2021-11-04 00:11:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-04 00:11:44,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:44,742 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:44,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-04 00:11:44,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-04 00:11:44,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1983187107, now seen corresponding path program 1 times [2021-11-04 00:11:44,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:44,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786426522] [2021-11-04 00:11:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:44,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:45,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:45,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786426522] [2021-11-04 00:11:45,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786426522] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:11:45,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011972366] [2021-11-04 00:11:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:45,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:11:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:11:45,089 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) [2021-11-04 00:11:45,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 00:11:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:45,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:11:45,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:11:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:45,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 00:11:45,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011972366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:45,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 00:11:45,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-04 00:11:45,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79603306] [2021-11-04 00:11:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:45,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:45,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:45,603 INFO L87 Difference]: Start difference. First operand 6618 states and 8967 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-04 00:11:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:48,717 INFO L93 Difference]: Finished difference Result 11954 states and 16114 transitions. [2021-11-04 00:11:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-04 00:11:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:48,722 INFO L225 Difference]: With dead ends: 11954 [2021-11-04 00:11:48,722 INFO L226 Difference]: Without dead ends: 5328 [2021-11-04 00:11:48,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.66ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:11:48,728 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2350.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.56ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2935.12ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:48,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 2887 Unknown, 0 Unchecked, 3.56ms Time], IncrementalHoareTripleChecker [3 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 2935.12ms Time] [2021-11-04 00:11:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2021-11-04 00:11:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 5252. [2021-11-04 00:11:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 5244 states have (on average 1.345537757437071) internal successors, (7056), 5251 states have internal predecessors, (7056), 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) [2021-11-04 00:11:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7056 transitions. [2021-11-04 00:11:48,964 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7056 transitions. Word has length 67 [2021-11-04 00:11:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:48,966 INFO L470 AbstractCegarLoop]: Abstraction has 5252 states and 7056 transitions. [2021-11-04 00:11:48,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-04 00:11:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7056 transitions. [2021-11-04 00:11:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-04 00:11:48,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:48,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:48,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-04 00:11:49,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-04 00:11:49,179 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 877143517, now seen corresponding path program 1 times [2021-11-04 00:11:49,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:49,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118169087] [2021-11-04 00:11:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:49,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:49,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:49,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118169087] [2021-11-04 00:11:49,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118169087] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:11:49,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854654052] [2021-11-04 00:11:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:49,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:11:49,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:11:49,293 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) [2021-11-04 00:11:49,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-04 00:11:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:49,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1459 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:11:49,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:11:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:49,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:11:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:50,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854654052] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:11:50,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 00:11:50,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-11-04 00:11:50,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054444422] [2021-11-04 00:11:50,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 00:11:50,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:11:50,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:11:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:11:50,017 INFO L87 Difference]: Start difference. First operand 5252 states and 7056 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2021-11-04 00:11:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:54,808 INFO L93 Difference]: Finished difference Result 15027 states and 20303 transitions. [2021-11-04 00:11:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:11:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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 67 [2021-11-04 00:11:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:54,818 INFO L225 Difference]: With dead ends: 15027 [2021-11-04 00:11:54,819 INFO L226 Difference]: Without dead ends: 9884 [2021-11-04 00:11:54,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 16.21ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:11:54,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2082 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3670.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.92ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4421.16ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:54,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2082 Valid, 0 Invalid, 3316 Unknown, 0 Unchecked, 6.92ms Time], IncrementalHoareTripleChecker [15 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 4421.16ms Time] [2021-11-04 00:11:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2021-11-04 00:11:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 9596. [2021-11-04 00:11:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9596 states, 9588 states have (on average 1.359511889862328) internal successors, (13035), 9595 states have internal predecessors, (13035), 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) [2021-11-04 00:11:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9596 states to 9596 states and 13035 transitions. [2021-11-04 00:11:55,123 INFO L78 Accepts]: Start accepts. Automaton has 9596 states and 13035 transitions. Word has length 67 [2021-11-04 00:11:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:55,123 INFO L470 AbstractCegarLoop]: Abstraction has 9596 states and 13035 transitions. [2021-11-04 00:11:55,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2021-11-04 00:11:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9596 states and 13035 transitions. [2021-11-04 00:11:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:11:55,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:55,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:55,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-04 00:11:55,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:11:55,340 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:11:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash -612371812, now seen corresponding path program 1 times [2021-11-04 00:11:55,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:55,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770585952] [2021-11-04 00:11:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:55,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:55,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:55,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770585952] [2021-11-04 00:11:55,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770585952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:55,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:55,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-04 00:11:55,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90762495] [2021-11-04 00:11:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:55,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 00:11:55,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 00:11:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:11:55,581 INFO L87 Difference]: Start difference. First operand 9596 states and 13035 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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) [2021-11-04 00:12:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:00,307 INFO L93 Difference]: Finished difference Result 9969 states and 13477 transitions. [2021-11-04 00:12:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-04 00:12:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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 68 [2021-11-04 00:12:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:00,317 INFO L225 Difference]: With dead ends: 9969 [2021-11-04 00:12:00,317 INFO L226 Difference]: Without dead ends: 9945 [2021-11-04 00:12:00,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 253.49ms TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2021-11-04 00:12:00,319 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1872 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3275.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.97ms SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4277.40ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:00,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1872 Valid, 0 Invalid, 3611 Unknown, 0 Unchecked, 6.97ms Time], IncrementalHoareTripleChecker [128 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 4277.40ms Time] [2021-11-04 00:12:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9945 states. [2021-11-04 00:12:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9945 to 9672. [2021-11-04 00:12:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9672 states, 9664 states have (on average 1.3585471854304636) internal successors, (13129), 9671 states have internal predecessors, (13129), 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) [2021-11-04 00:12:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9672 states to 9672 states and 13129 transitions. [2021-11-04 00:12:00,642 INFO L78 Accepts]: Start accepts. Automaton has 9672 states and 13129 transitions. Word has length 68 [2021-11-04 00:12:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:00,643 INFO L470 AbstractCegarLoop]: Abstraction has 9672 states and 13129 transitions. [2021-11-04 00:12:00,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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) [2021-11-04 00:12:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 9672 states and 13129 transitions. [2021-11-04 00:12:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:12:00,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:00,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:00,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 00:12:00,645 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:12:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1421718438, now seen corresponding path program 1 times [2021-11-04 00:12:00,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:00,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959636069] [2021-11-04 00:12:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:00,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:00,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:00,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959636069] [2021-11-04 00:12:00,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959636069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:00,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:00,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 00:12:00,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020732149] [2021-11-04 00:12:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:00,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:12:00,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:12:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:12:00,849 INFO L87 Difference]: Start difference. First operand 9672 states and 13129 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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) [2021-11-04 00:12:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:11,661 INFO L93 Difference]: Finished difference Result 54830 states and 74792 transitions. [2021-11-04 00:12:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 00:12:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 68 [2021-11-04 00:12:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:11,722 INFO L225 Difference]: With dead ends: 54830 [2021-11-04 00:12:11,722 INFO L226 Difference]: Without dead ends: 45245 [2021-11-04 00:12:11,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 137.37ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-11-04 00:12:11,743 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5864 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 8935 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7781.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5864 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.53ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 8935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9330.58ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:11,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5864 Valid, 0 Invalid, 8962 Unknown, 0 Unchecked, 20.53ms Time], IncrementalHoareTripleChecker [27 Valid, 8935 Invalid, 0 Unknown, 0 Unchecked, 9330.58ms Time] [2021-11-04 00:12:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45245 states. [2021-11-04 00:12:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45245 to 9611. [2021-11-04 00:12:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9611 states, 9603 states have (on average 1.3584296573987296) internal successors, (13045), 9610 states have internal predecessors, (13045), 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) [2021-11-04 00:12:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9611 states to 9611 states and 13045 transitions. [2021-11-04 00:12:12,340 INFO L78 Accepts]: Start accepts. Automaton has 9611 states and 13045 transitions. Word has length 68 [2021-11-04 00:12:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:12,341 INFO L470 AbstractCegarLoop]: Abstraction has 9611 states and 13045 transitions. [2021-11-04 00:12:12,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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) [2021-11-04 00:12:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 13045 transitions. [2021-11-04 00:12:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:12:12,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:12,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:12,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 00:12:12,343 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:12:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -965460194, now seen corresponding path program 1 times [2021-11-04 00:12:12,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:12,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597801975] [2021-11-04 00:12:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:12,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:12,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:12,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597801975] [2021-11-04 00:12:12,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597801975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:12,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:12,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-04 00:12:12,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601601701] [2021-11-04 00:12:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:12,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 00:12:12,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 00:12:12,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:12:12,697 INFO L87 Difference]: Start difference. First operand 9611 states and 13045 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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) [2021-11-04 00:12:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:19,222 INFO L93 Difference]: Finished difference Result 9963 states and 13465 transitions. [2021-11-04 00:12:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 00:12:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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 68 [2021-11-04 00:12:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:19,231 INFO L225 Difference]: With dead ends: 9963 [2021-11-04 00:12:19,231 INFO L226 Difference]: Without dead ends: 9939 [2021-11-04 00:12:19,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 243.31ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-11-04 00:12:19,233 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1430 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 5255 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4726.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.02ms SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 5255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5900.41ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:19,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 0 Invalid, 5338 Unknown, 0 Unchecked, 9.02ms Time], IncrementalHoareTripleChecker [83 Valid, 5255 Invalid, 0 Unknown, 0 Unchecked, 5900.41ms Time] [2021-11-04 00:12:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2021-11-04 00:12:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9687. [2021-11-04 00:12:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9687 states, 9679 states have (on average 1.3573716293005476) internal successors, (13138), 9686 states have internal predecessors, (13138), 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) [2021-11-04 00:12:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9687 states to 9687 states and 13138 transitions. [2021-11-04 00:12:19,618 INFO L78 Accepts]: Start accepts. Automaton has 9687 states and 13138 transitions. Word has length 68 [2021-11-04 00:12:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:19,618 INFO L470 AbstractCegarLoop]: Abstraction has 9687 states and 13138 transitions. [2021-11-04 00:12:19,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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) [2021-11-04 00:12:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 9687 states and 13138 transitions. [2021-11-04 00:12:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:12:19,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:19,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:19,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 00:12:19,620 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:12:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1774806820, now seen corresponding path program 1 times [2021-11-04 00:12:19,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:19,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669044239] [2021-11-04 00:12:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:19,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:20,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:20,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669044239] [2021-11-04 00:12:20,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669044239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:20,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:20,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-04 00:12:20,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329982071] [2021-11-04 00:12:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:20,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-04 00:12:20,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-04 00:12:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-04 00:12:20,271 INFO L87 Difference]: Start difference. First operand 9687 states and 13138 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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) [2021-11-04 00:12:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:43,964 INFO L93 Difference]: Finished difference Result 38480 states and 52687 transitions. [2021-11-04 00:12:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-04 00:12:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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 68 [2021-11-04 00:12:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:44,033 INFO L225 Difference]: With dead ends: 38480 [2021-11-04 00:12:44,033 INFO L226 Difference]: Without dead ends: 38389 [2021-11-04 00:12:44,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 771.26ms TimeCoverageRelationStatistics Valid=993, Invalid=3563, Unknown=0, NotChecked=0, Total=4556 [2021-11-04 00:12:44,047 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6738 mSDsluCounter, 15323 mSDsCounter, 0 mSdLazyCounter, 20146 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17251.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6738 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 60.25ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 20146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20783.94ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:44,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6738 Valid, 0 Invalid, 20223 Unknown, 0 Unchecked, 60.25ms Time], IncrementalHoareTripleChecker [77 Valid, 20146 Invalid, 0 Unknown, 0 Unchecked, 20783.94ms Time] [2021-11-04 00:12:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38389 states. [2021-11-04 00:12:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38389 to 9707. [2021-11-04 00:12:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9707 states, 9699 states have (on average 1.3555005670687699) internal successors, (13147), 9706 states have internal predecessors, (13147), 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) [2021-11-04 00:12:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 13147 transitions. [2021-11-04 00:12:44,775 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 13147 transitions. Word has length 68 [2021-11-04 00:12:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:44,776 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 13147 transitions. [2021-11-04 00:12:44,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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) [2021-11-04 00:12:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 13147 transitions. [2021-11-04 00:12:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:12:44,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:44,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:44,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 00:12:44,778 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:12:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1509043226, now seen corresponding path program 1 times [2021-11-04 00:12:44,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:44,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656920769] [2021-11-04 00:12:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:44,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:44,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:44,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656920769] [2021-11-04 00:12:44,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656920769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:44,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:44,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:12:44,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574501307] [2021-11-04 00:12:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:44,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:12:44,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:12:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:44,886 INFO L87 Difference]: Start difference. First operand 9707 states and 13147 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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) [2021-11-04 00:12:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:56,118 INFO L93 Difference]: Finished difference Result 57325 states and 78071 transitions. [2021-11-04 00:12:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 00:12:56,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 68 [2021-11-04 00:12:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:56,193 INFO L225 Difference]: With dead ends: 57325 [2021-11-04 00:12:56,193 INFO L226 Difference]: Without dead ends: 52488 [2021-11-04 00:12:56,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.95ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:12:56,212 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5127 mSDsluCounter, 4762 mSDsCounter, 0 mSdLazyCounter, 6451 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6567.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.36ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8115.97ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:56,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5127 Valid, 0 Invalid, 6475 Unknown, 0 Unchecked, 21.36ms Time], IncrementalHoareTripleChecker [24 Valid, 6451 Invalid, 0 Unknown, 0 Unchecked, 8115.97ms Time] [2021-11-04 00:12:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2021-11-04 00:12:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 9794. [2021-11-04 00:12:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9794 states, 9786 states have (on average 1.352340077661966) internal successors, (13234), 9793 states have internal predecessors, (13234), 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) [2021-11-04 00:12:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9794 states to 9794 states and 13234 transitions. [2021-11-04 00:12:57,089 INFO L78 Accepts]: Start accepts. Automaton has 9794 states and 13234 transitions. Word has length 68 [2021-11-04 00:12:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:57,089 INFO L470 AbstractCegarLoop]: Abstraction has 9794 states and 13234 transitions. [2021-11-04 00:12:57,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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) [2021-11-04 00:12:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9794 states and 13234 transitions. [2021-11-04 00:12:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 00:12:57,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:57,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:57,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 00:12:57,091 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:12:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -79304676, now seen corresponding path program 1 times [2021-11-04 00:12:57,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:57,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774683390] [2021-11-04 00:12:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:57,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:57,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:57,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774683390] [2021-11-04 00:12:57,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774683390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:57,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:57,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 00:12:57,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718054087] [2021-11-04 00:12:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:57,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:12:57,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:12:57,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:12:57,189 INFO L87 Difference]: Start difference. First operand 9794 states and 13234 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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) [2021-11-04 00:12:59,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:13,812 INFO L93 Difference]: Finished difference Result 58298 states and 79454 transitions. [2021-11-04 00:13:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-04 00:13:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 68 [2021-11-04 00:13:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:13,898 INFO L225 Difference]: With dead ends: 58298 [2021-11-04 00:13:13,898 INFO L226 Difference]: Without dead ends: 48677 [2021-11-04 00:13:13,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 59.91ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-04 00:13:13,919 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4980 mSDsluCounter, 9059 mSDsCounter, 0 mSdLazyCounter, 11347 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11095.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4980 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.02ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13179.97ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:13,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4980 Valid, 0 Invalid, 11366 Unknown, 0 Unchecked, 21.02ms Time], IncrementalHoareTripleChecker [19 Valid, 11347 Invalid, 0 Unknown, 0 Unchecked, 13179.97ms Time] [2021-11-04 00:13:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48677 states. [2021-11-04 00:13:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48677 to 9732. [2021-11-04 00:13:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 9724 states have (on average 1.3504730563554093) internal successors, (13132), 9731 states have internal predecessors, (13132), 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) [2021-11-04 00:13:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 13132 transitions. [2021-11-04 00:13:14,839 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 13132 transitions. Word has length 68 [2021-11-04 00:13:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:14,839 INFO L470 AbstractCegarLoop]: Abstraction has 9732 states and 13132 transitions. [2021-11-04 00:13:14,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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) [2021-11-04 00:13:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 13132 transitions. [2021-11-04 00:13:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-04 00:13:14,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:14,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:14,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 00:13:14,841 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash 870669115, now seen corresponding path program 1 times [2021-11-04 00:13:14,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:14,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199622012] [2021-11-04 00:13:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:14,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:15,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:15,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199622012] [2021-11-04 00:13:15,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199622012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:15,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:15,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:13:15,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197911359] [2021-11-04 00:13:15,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:15,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:15,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:15,062 INFO L87 Difference]: Start difference. First operand 9732 states and 13132 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) [2021-11-04 00:13:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:20,343 INFO L93 Difference]: Finished difference Result 22095 states and 29863 transitions. [2021-11-04 00:13:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) Word has length 73 [2021-11-04 00:13:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:20,356 INFO L225 Difference]: With dead ends: 22095 [2021-11-04 00:13:20,356 INFO L226 Difference]: Without dead ends: 12437 [2021-11-04 00:13:20,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:13:20,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 629 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3198.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.23ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4067.61ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:20,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 0 Invalid, 3251 Unknown, 0 Unchecked, 6.23ms Time], IncrementalHoareTripleChecker [1 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 4067.61ms Time] [2021-11-04 00:13:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12437 states. [2021-11-04 00:13:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12437 to 6781. [2021-11-04 00:13:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6781 states, 6773 states have (on average 1.3584822087701167) internal successors, (9201), 6780 states have internal predecessors, (9201), 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) [2021-11-04 00:13:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6781 states to 6781 states and 9201 transitions. [2021-11-04 00:13:20,915 INFO L78 Accepts]: Start accepts. Automaton has 6781 states and 9201 transitions. Word has length 73 [2021-11-04 00:13:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:20,915 INFO L470 AbstractCegarLoop]: Abstraction has 6781 states and 9201 transitions. [2021-11-04 00:13:20,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) [2021-11-04 00:13:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6781 states and 9201 transitions. [2021-11-04 00:13:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-04 00:13:20,917 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:20,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:20,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 00:13:20,917 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -599419909, now seen corresponding path program 1 times [2021-11-04 00:13:20,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:20,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506341332] [2021-11-04 00:13:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:20,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:21,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:21,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506341332] [2021-11-04 00:13:21,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506341332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:21,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:21,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:21,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777772038] [2021-11-04 00:13:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:21,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:21,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:21,015 INFO L87 Difference]: Start difference. First operand 6781 states and 9201 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 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) [2021-11-04 00:13:22,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:27,034 INFO L93 Difference]: Finished difference Result 12040 states and 16243 transitions. [2021-11-04 00:13:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:27,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 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) Word has length 73 [2021-11-04 00:13:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:27,053 INFO L225 Difference]: With dead ends: 12040 [2021-11-04 00:13:27,053 INFO L226 Difference]: Without dead ends: 12027 [2021-11-04 00:13:27,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.54ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:27,059 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1221 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4140.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4883.39ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:27,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 0 Invalid, 2750 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [14 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 4883.39ms Time] [2021-11-04 00:13:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12027 states. [2021-11-04 00:13:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12027 to 11489. [2021-11-04 00:13:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11489 states, 11481 states have (on average 1.35693754899399) internal successors, (15579), 11488 states have internal predecessors, (15579), 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) [2021-11-04 00:13:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 15579 transitions. [2021-11-04 00:13:28,216 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 15579 transitions. Word has length 73 [2021-11-04 00:13:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:28,216 INFO L470 AbstractCegarLoop]: Abstraction has 11489 states and 15579 transitions. [2021-11-04 00:13:28,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 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) [2021-11-04 00:13:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 15579 transitions. [2021-11-04 00:13:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-04 00:13:28,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:28,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:28,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 00:13:28,219 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash -949414679, now seen corresponding path program 1 times [2021-11-04 00:13:28,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:28,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264740668] [2021-11-04 00:13:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:28,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:28,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:28,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264740668] [2021-11-04 00:13:28,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264740668] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:28,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:28,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:28,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44795270] [2021-11-04 00:13:28,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:28,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:13:28,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:13:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:13:28,337 INFO L87 Difference]: Start difference. First operand 11489 states and 15579 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2021-11-04 00:13:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:32,520 INFO L93 Difference]: Finished difference Result 19662 states and 26650 transitions. [2021-11-04 00:13:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:13:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2021-11-04 00:13:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:32,530 INFO L225 Difference]: With dead ends: 19662 [2021-11-04 00:13:32,530 INFO L226 Difference]: Without dead ends: 8347 [2021-11-04 00:13:32,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.27ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:13:32,542 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 687 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2560.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.87ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3234.66ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:32,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 0 Invalid, 2043 Unknown, 0 Unchecked, 2.87ms Time], IncrementalHoareTripleChecker [8 Valid, 2035 Invalid, 0 Unknown, 0 Unchecked, 3234.66ms Time] [2021-11-04 00:13:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8347 states. [2021-11-04 00:13:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8347 to 8305. [2021-11-04 00:13:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8305 states, 8297 states have (on average 1.3491623478365675) internal successors, (11194), 8304 states have internal predecessors, (11194), 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) [2021-11-04 00:13:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8305 states to 8305 states and 11194 transitions. [2021-11-04 00:13:33,408 INFO L78 Accepts]: Start accepts. Automaton has 8305 states and 11194 transitions. Word has length 79 [2021-11-04 00:13:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:33,408 INFO L470 AbstractCegarLoop]: Abstraction has 8305 states and 11194 transitions. [2021-11-04 00:13:33,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2021-11-04 00:13:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 8305 states and 11194 transitions. [2021-11-04 00:13:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-04 00:13:33,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:33,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:33,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 00:13:33,412 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash -786465020, now seen corresponding path program 1 times [2021-11-04 00:13:33,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:33,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396703964] [2021-11-04 00:13:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:33,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:33,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:33,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396703964] [2021-11-04 00:13:33,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396703964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:33,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:33,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:33,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925482880] [2021-11-04 00:13:33,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:33,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:33,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:33,698 INFO L87 Difference]: Start difference. First operand 8305 states and 11194 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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) [2021-11-04 00:13:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:38,889 INFO L93 Difference]: Finished difference Result 24829 states and 33470 transitions. [2021-11-04 00:13:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2021-11-04 00:13:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:38,909 INFO L225 Difference]: With dead ends: 24829 [2021-11-04 00:13:38,909 INFO L226 Difference]: Without dead ends: 19957 [2021-11-04 00:13:38,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.13ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:38,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1237 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2627.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.95ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3264.04ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:38,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1237 Valid, 0 Invalid, 2751 Unknown, 0 Unchecked, 3.95ms Time], IncrementalHoareTripleChecker [16 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 3264.04ms Time] [2021-11-04 00:13:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19957 states. [2021-11-04 00:13:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19957 to 18449. [2021-11-04 00:13:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18449 states, 18441 states have (on average 1.3564340328615585) internal successors, (25014), 18448 states have internal predecessors, (25014), 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) [2021-11-04 00:13:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18449 states to 18449 states and 25014 transitions. [2021-11-04 00:13:40,816 INFO L78 Accepts]: Start accepts. Automaton has 18449 states and 25014 transitions. Word has length 81 [2021-11-04 00:13:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:40,816 INFO L470 AbstractCegarLoop]: Abstraction has 18449 states and 25014 transitions. [2021-11-04 00:13:40,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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) [2021-11-04 00:13:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18449 states and 25014 transitions. [2021-11-04 00:13:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-04 00:13:40,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:40,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:40,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 00:13:40,819 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2028113370, now seen corresponding path program 1 times [2021-11-04 00:13:40,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:40,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289611795] [2021-11-04 00:13:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:40,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:40,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:40,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289611795] [2021-11-04 00:13:40,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289611795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:40,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:40,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 00:13:40,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090903218] [2021-11-04 00:13:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:40,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:13:40,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:13:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:13:40,937 INFO L87 Difference]: Start difference. First operand 18449 states and 25014 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2021-11-04 00:13:42,232 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:44,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:46,887 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:56,991 INFO L93 Difference]: Finished difference Result 69562 states and 94775 transitions. [2021-11-04 00:13:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:13:56,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 87 [2021-11-04 00:13:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:57,068 INFO L225 Difference]: With dead ends: 69562 [2021-11-04 00:13:57,068 INFO L226 Difference]: Without dead ends: 52275 [2021-11-04 00:13:57,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.77ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:13:57,092 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2632 mSDsluCounter, 4333 mSDsCounter, 0 mSdLazyCounter, 5773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9288.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.37ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10915.93ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:57,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2632 Valid, 0 Invalid, 5796 Unknown, 0 Unchecked, 11.37ms Time], IncrementalHoareTripleChecker [23 Valid, 5773 Invalid, 0 Unknown, 0 Unchecked, 10915.93ms Time] [2021-11-04 00:13:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52275 states. [2021-11-04 00:13:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52275 to 18465. [2021-11-04 00:13:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 18457 states have (on average 1.3555832475483556) internal successors, (25020), 18464 states have internal predecessors, (25020), 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) [2021-11-04 00:13:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 25020 transitions. [2021-11-04 00:13:59,135 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 25020 transitions. Word has length 87 [2021-11-04 00:13:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:59,136 INFO L470 AbstractCegarLoop]: Abstraction has 18465 states and 25020 transitions. [2021-11-04 00:13:59,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2021-11-04 00:13:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 25020 transitions. [2021-11-04 00:13:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-04 00:13:59,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:59,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:59,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-04 00:13:59,139 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:13:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2005481116, now seen corresponding path program 1 times [2021-11-04 00:13:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:59,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533750898] [2021-11-04 00:13:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:59,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:59,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:59,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533750898] [2021-11-04 00:13:59,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533750898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:59,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:59,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:59,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890431395] [2021-11-04 00:13:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:59,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:13:59,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:13:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:13:59,236 INFO L87 Difference]: Start difference. First operand 18465 states and 25020 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2021-11-04 00:14:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:03,173 INFO L93 Difference]: Finished difference Result 35733 states and 48493 transitions. [2021-11-04 00:14:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:14:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2021-11-04 00:14:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:03,196 INFO L225 Difference]: With dead ends: 35733 [2021-11-04 00:14:03,196 INFO L226 Difference]: Without dead ends: 18525 [2021-11-04 00:14:03,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.78ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:14:03,215 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1582.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2086.49ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:03,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1418 Unknown, 0 Unchecked, 1.54ms Time], IncrementalHoareTripleChecker [2 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 2086.49ms Time] [2021-11-04 00:14:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18525 states. [2021-11-04 00:14:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18525 to 18525. [2021-11-04 00:14:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18525 states, 18517 states have (on average 1.3544310633471945) internal successors, (25080), 18524 states have internal predecessors, (25080), 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) [2021-11-04 00:14:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 25080 transitions. [2021-11-04 00:14:05,247 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 25080 transitions. Word has length 87 [2021-11-04 00:14:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:05,247 INFO L470 AbstractCegarLoop]: Abstraction has 18525 states and 25080 transitions. [2021-11-04 00:14:05,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2021-11-04 00:14:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 25080 transitions. [2021-11-04 00:14:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-04 00:14:05,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:05,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:05,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-04 00:14:05,251 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1472640899, now seen corresponding path program 1 times [2021-11-04 00:14:05,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:05,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495123675] [2021-11-04 00:14:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:05,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:05,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:05,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495123675] [2021-11-04 00:14:05,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495123675] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:14:05,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288723617] [2021-11-04 00:14:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:05,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:14:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:14:05,383 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) [2021-11-04 00:14:05,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-04 00:14:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:05,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:14:05,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:14:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:06,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:14:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:06,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288723617] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:14:06,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 00:14:06,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 00:14:06,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867749275] [2021-11-04 00:14:06,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 00:14:06,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 00:14:06,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 00:14:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:14:06,215 INFO L87 Difference]: Start difference. First operand 18525 states and 25080 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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) [2021-11-04 00:14:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:12,399 INFO L93 Difference]: Finished difference Result 37461 states and 51052 transitions. [2021-11-04 00:14:12,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 00:14:12,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 88 [2021-11-04 00:14:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:12,428 INFO L225 Difference]: With dead ends: 37461 [2021-11-04 00:14:12,428 INFO L226 Difference]: Without dead ends: 19045 [2021-11-04 00:14:12,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.80ms TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:14:12,445 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2973.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.01ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3971.80ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:12,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 2155 Unknown, 0 Unchecked, 5.01ms Time], IncrementalHoareTripleChecker [24 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 3971.80ms Time] [2021-11-04 00:14:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19045 states. [2021-11-04 00:14:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19045 to 19045. [2021-11-04 00:14:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19045 states, 19037 states have (on average 1.3447496979566107) internal successors, (25600), 19044 states have internal predecessors, (25600), 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) [2021-11-04 00:14:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 25600 transitions. [2021-11-04 00:14:14,408 INFO L78 Accepts]: Start accepts. Automaton has 19045 states and 25600 transitions. Word has length 88 [2021-11-04 00:14:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:14,408 INFO L470 AbstractCegarLoop]: Abstraction has 19045 states and 25600 transitions. [2021-11-04 00:14:14,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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) [2021-11-04 00:14:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19045 states and 25600 transitions. [2021-11-04 00:14:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-04 00:14:14,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:14,410 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:14,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-04 00:14:14,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-04 00:14:14,619 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1532344412, now seen corresponding path program 2 times [2021-11-04 00:14:14,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:14,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772926907] [2021-11-04 00:14:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:14,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:14,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:14,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772926907] [2021-11-04 00:14:14,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772926907] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:14:14,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356264172] [2021-11-04 00:14:14,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-04 00:14:14,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:14:14,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:14:14,771 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) [2021-11-04 00:14:14,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-04 00:14:15,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-04 00:14:15,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-04 00:14:15,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1831 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-04 00:14:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:14:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 00:14:15,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 00:14:15,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356264172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:15,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 00:14:15,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-11-04 00:14:15,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555816945] [2021-11-04 00:14:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:15,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:14:15,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:14:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:14:15,386 INFO L87 Difference]: Start difference. First operand 19045 states and 25600 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2021-11-04 00:14:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:21,753 INFO L93 Difference]: Finished difference Result 31929 states and 43292 transitions. [2021-11-04 00:14:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:14:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 91 [2021-11-04 00:14:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:21,792 INFO L225 Difference]: With dead ends: 31929 [2021-11-04 00:14:21,792 INFO L226 Difference]: Without dead ends: 31920 [2021-11-04 00:14:21,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 44.78ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:14:21,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1326 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2262.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2908.95ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:21,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 0 Invalid, 1957 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [3 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 2908.95ms Time] [2021-11-04 00:14:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31920 states. [2021-11-04 00:14:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31920 to 19065. [2021-11-04 00:14:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19057 states have (on average 1.343338405835126) internal successors, (25600), 19064 states have internal predecessors, (25600), 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) [2021-11-04 00:14:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 25600 transitions. [2021-11-04 00:14:23,935 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 25600 transitions. Word has length 91 [2021-11-04 00:14:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:23,936 INFO L470 AbstractCegarLoop]: Abstraction has 19065 states and 25600 transitions. [2021-11-04 00:14:23,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2021-11-04 00:14:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 25600 transitions. [2021-11-04 00:14:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-04 00:14:23,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:23,938 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:23,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-04 00:14:24,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-04 00:14:24,138 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1795713238, now seen corresponding path program 1 times [2021-11-04 00:14:24,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:24,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112989372] [2021-11-04 00:14:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:24,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 00:14:24,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:24,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112989372] [2021-11-04 00:14:24,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112989372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:24,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:24,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:14:24,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252460491] [2021-11-04 00:14:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:24,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:14:24,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:14:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:14:24,211 INFO L87 Difference]: Start difference. First operand 19065 states and 25600 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2021-11-04 00:14:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:29,265 INFO L93 Difference]: Finished difference Result 38066 states and 51110 transitions. [2021-11-04 00:14:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:14:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 91 [2021-11-04 00:14:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:29,289 INFO L225 Difference]: With dead ends: 38066 [2021-11-04 00:14:29,289 INFO L226 Difference]: Without dead ends: 19104 [2021-11-04 00:14:29,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:14:29,309 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2218.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.33ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2940.00ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:29,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 2132 Unknown, 0 Unchecked, 2.33ms Time], IncrementalHoareTripleChecker [4 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 2940.00ms Time] [2021-11-04 00:14:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19104 states. [2021-11-04 00:14:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19104 to 19071. [2021-11-04 00:14:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19071 states, 19063 states have (on average 1.3424434768924094) internal successors, (25591), 19070 states have internal predecessors, (25591), 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) [2021-11-04 00:14:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19071 states to 19071 states and 25591 transitions. [2021-11-04 00:14:31,404 INFO L78 Accepts]: Start accepts. Automaton has 19071 states and 25591 transitions. Word has length 91 [2021-11-04 00:14:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:31,405 INFO L470 AbstractCegarLoop]: Abstraction has 19071 states and 25591 transitions. [2021-11-04 00:14:31,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2021-11-04 00:14:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 19071 states and 25591 transitions. [2021-11-04 00:14:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-04 00:14:31,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:31,406 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:31,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-04 00:14:31,407 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1963927494, now seen corresponding path program 1 times [2021-11-04 00:14:31,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:31,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671137033] [2021-11-04 00:14:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:31,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 00:14:31,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:31,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671137033] [2021-11-04 00:14:31,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671137033] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:14:31,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790285926] [2021-11-04 00:14:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:31,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:14:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:14:31,523 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) [2021-11-04 00:14:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-04 00:14:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:31,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1869 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-04 00:14:31,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:14:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:14:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:32,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790285926] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:14:32,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 00:14:32,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2021-11-04 00:14:32,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369954278] [2021-11-04 00:14:32,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 00:14:32,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-04 00:14:32,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-04 00:14:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-11-04 00:14:32,331 INFO L87 Difference]: Start difference. First operand 19071 states and 25591 transitions. Second operand has 14 states, 14 states have (on average 13.285714285714286) internal successors, (186), 14 states have internal predecessors, (186), 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) [2021-11-04 00:14:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:41,731 INFO L93 Difference]: Finished difference Result 38918 states and 52668 transitions. [2021-11-04 00:14:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-04 00:14:41,731 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.285714285714286) internal successors, (186), 14 states have internal predecessors, (186), 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 96 [2021-11-04 00:14:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:41,753 INFO L225 Difference]: With dead ends: 38918 [2021-11-04 00:14:41,754 INFO L226 Difference]: Without dead ends: 19956 [2021-11-04 00:14:41,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 338.65ms TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2021-11-04 00:14:41,768 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1155 mSDsluCounter, 3685 mSDsCounter, 0 mSdLazyCounter, 5010 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5080.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.49ms SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 5010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6576.91ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:41,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1155 Valid, 0 Invalid, 5131 Unknown, 0 Unchecked, 8.49ms Time], IncrementalHoareTripleChecker [121 Valid, 5010 Invalid, 0 Unknown, 0 Unchecked, 6576.91ms Time] [2021-11-04 00:14:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19956 states. [2021-11-04 00:14:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19956 to 19796. [2021-11-04 00:14:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19796 states, 19788 states have (on average 1.3275217303416211) internal successors, (26269), 19795 states have internal predecessors, (26269), 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) [2021-11-04 00:14:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 26269 transitions. [2021-11-04 00:14:44,018 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 26269 transitions. Word has length 96 [2021-11-04 00:14:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:44,018 INFO L470 AbstractCegarLoop]: Abstraction has 19796 states and 26269 transitions. [2021-11-04 00:14:44,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.285714285714286) internal successors, (186), 14 states have internal predecessors, (186), 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) [2021-11-04 00:14:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 26269 transitions. [2021-11-04 00:14:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-04 00:14:44,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:44,020 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:44,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-04 00:14:44,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-04 00:14:44,221 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1609962652, now seen corresponding path program 1 times [2021-11-04 00:14:44,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:44,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689201349] [2021-11-04 00:14:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:44,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 00:14:44,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:44,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689201349] [2021-11-04 00:14:44,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689201349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:44,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:44,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:14:44,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767302349] [2021-11-04 00:14:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:44,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:14:44,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:14:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:14:44,303 INFO L87 Difference]: Start difference. First operand 19796 states and 26269 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2021-11-04 00:14:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:49,449 INFO L93 Difference]: Finished difference Result 39528 states and 52448 transitions. [2021-11-04 00:14:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:14:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 107 [2021-11-04 00:14:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:49,472 INFO L225 Difference]: With dead ends: 39528 [2021-11-04 00:14:49,472 INFO L226 Difference]: Without dead ends: 19835 [2021-11-04 00:14:49,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.45ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:14:49,487 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2096.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.45ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2842.38ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:49,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 2132 Unknown, 0 Unchecked, 2.45ms Time], IncrementalHoareTripleChecker [6 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 2842.38ms Time] [2021-11-04 00:14:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19835 states. [2021-11-04 00:14:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19835 to 19796. [2021-11-04 00:14:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19796 states, 19788 states have (on average 1.3272185162724883) internal successors, (26263), 19795 states have internal predecessors, (26263), 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) [2021-11-04 00:14:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 26263 transitions. [2021-11-04 00:14:51,732 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 26263 transitions. Word has length 107 [2021-11-04 00:14:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:51,732 INFO L470 AbstractCegarLoop]: Abstraction has 19796 states and 26263 transitions. [2021-11-04 00:14:51,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2021-11-04 00:14:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 26263 transitions. [2021-11-04 00:14:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-04 00:14:51,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:51,734 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:51,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-04 00:14:51,735 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:14:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 99175275, now seen corresponding path program 1 times [2021-11-04 00:14:51,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:51,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592148305] [2021-11-04 00:14:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:51,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 00:14:51,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:51,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592148305] [2021-11-04 00:14:51,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592148305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:51,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:51,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:14:51,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378751945] [2021-11-04 00:14:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:51,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:14:51,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:14:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:14:51,823 INFO L87 Difference]: Start difference. First operand 19796 states and 26263 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:14:54,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:00,011 INFO L93 Difference]: Finished difference Result 39551 states and 52473 transitions. [2021-11-04 00:15:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:15:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-04 00:15:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:00,036 INFO L225 Difference]: With dead ends: 39551 [2021-11-04 00:15:00,037 INFO L226 Difference]: Without dead ends: 19855 [2021-11-04 00:15:00,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.32ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:15:00,056 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4795.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.67ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5872.82ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:00,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 2859 Unknown, 0 Unchecked, 3.67ms Time], IncrementalHoareTripleChecker [1 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 5872.82ms Time] [2021-11-04 00:15:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19855 states. [2021-11-04 00:15:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19855 to 19805. [2021-11-04 00:15:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19805 states, 19797 states have (on average 1.3270697580441482) internal successors, (26272), 19804 states have internal predecessors, (26272), 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) [2021-11-04 00:15:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19805 states to 19805 states and 26272 transitions. [2021-11-04 00:15:02,344 INFO L78 Accepts]: Start accepts. Automaton has 19805 states and 26272 transitions. Word has length 112 [2021-11-04 00:15:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:02,344 INFO L470 AbstractCegarLoop]: Abstraction has 19805 states and 26272 transitions. [2021-11-04 00:15:02,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19805 states and 26272 transitions. [2021-11-04 00:15:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-04 00:15:02,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:02,346 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:15:02,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-04 00:15:02,347 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:15:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1419328376, now seen corresponding path program 1 times [2021-11-04 00:15:02,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:02,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251061250] [2021-11-04 00:15:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:02,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-04 00:15:02,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:02,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251061250] [2021-11-04 00:15:02,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251061250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:15:02,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:15:02,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 00:15:02,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514610704] [2021-11-04 00:15:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:15:02,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:15:02,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:15:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:15:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:15:02,513 INFO L87 Difference]: Start difference. First operand 19805 states and 26272 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-04 00:15:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:15,705 INFO L93 Difference]: Finished difference Result 71984 states and 96555 transitions. [2021-11-04 00:15:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:15:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 115 [2021-11-04 00:15:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:15,811 INFO L225 Difference]: With dead ends: 71984 [2021-11-04 00:15:15,811 INFO L226 Difference]: Without dead ends: 53436 [2021-11-04 00:15:15,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.01ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:15:15,837 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2504 mSDsluCounter, 4450 mSDsCounter, 0 mSdLazyCounter, 5983 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5288.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.59ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6912.32ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:15,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2504 Valid, 0 Invalid, 6003 Unknown, 0 Unchecked, 11.59ms Time], IncrementalHoareTripleChecker [20 Valid, 5983 Invalid, 0 Unknown, 0 Unchecked, 6912.32ms Time] [2021-11-04 00:15:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53436 states. [2021-11-04 00:15:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53436 to 19821. [2021-11-04 00:15:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19821 states, 19813 states have (on average 1.3263009135416142) internal successors, (26278), 19820 states have internal predecessors, (26278), 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) [2021-11-04 00:15:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19821 states to 19821 states and 26278 transitions. [2021-11-04 00:15:18,532 INFO L78 Accepts]: Start accepts. Automaton has 19821 states and 26278 transitions. Word has length 115 [2021-11-04 00:15:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:18,532 INFO L470 AbstractCegarLoop]: Abstraction has 19821 states and 26278 transitions. [2021-11-04 00:15:18,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-04 00:15:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19821 states and 26278 transitions. [2021-11-04 00:15:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-04 00:15:18,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:18,535 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:15:18,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-04 00:15:18,535 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 00:15:18,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1403809658, now seen corresponding path program 1 times [2021-11-04 00:15:18,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:18,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999037320] [2021-11-04 00:15:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:18,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-04 00:15:19,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:19,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999037320] [2021-11-04 00:15:19,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999037320] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:15:19,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79095149] [2021-11-04 00:15:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:19,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:15:19,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:15:19,468 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) [2021-11-04 00:15:19,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-04 00:15:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:19,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-04 00:15:19,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:15:20,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:20,389 INFO L388 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 19 treesize of output 18 [2021-11-04 00:15:20,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:20,414 INFO L388 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 19 treesize of output 18 [2021-11-04 00:15:20,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:20,499 INFO L388 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 19 treesize of output 18 [2021-11-04 00:15:20,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:20,549 INFO L388 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 19 treesize of output 18 [2021-11-04 00:15:20,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:20,785 INFO L354 Elim1Store]: treesize reduction 590, result has 21.0 percent of original size [2021-11-04 00:15:20,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 414 [2021-11-04 00:15:22,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:22,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:22,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:22,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:22,657 INFO L354 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2021-11-04 00:15:22,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 103 [2021-11-04 00:15:23,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,054 INFO L354 Elim1Store]: treesize reduction 49, result has 22.2 percent of original size [2021-11-04 00:15:23,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 52 [2021-11-04 00:15:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,220 INFO L388 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 57 treesize of output 29 [2021-11-04 00:15:23,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-04 00:15:23,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:23,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 115 treesize of output 75 [2021-11-04 00:15:24,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-04 00:15:24,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 64 treesize of output 32 [2021-11-04 00:15:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,713 INFO L388 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 49 treesize of output 29 [2021-11-04 00:15:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:24,795 INFO L388 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 49 treesize of output 29 [2021-11-04 00:15:33,377 WARN L210 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 34 [2021-11-04 00:15:33,494 INFO L388 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 81 treesize of output 75 [2021-11-04 00:15:33,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:33,625 INFO L354 Elim1Store]: treesize reduction 244, result has 26.7 percent of original size [2021-11-04 00:15:33,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 75 treesize of output 122 [2021-11-04 00:15:33,635 INFO L388 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 122 treesize of output 104 [2021-11-04 00:15:46,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:46,635 INFO L354 Elim1Store]: treesize reduction 318, result has 20.1 percent of original size [2021-11-04 00:15:46,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 163 treesize of output 158 [2021-11-04 00:15:49,359 INFO L388 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 19 treesize of output 15 [2021-11-04 00:15:49,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,538 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-04 00:15:49,539 INFO L388 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 1 case distinctions, treesize of input 45 treesize of output 26 [2021-11-04 00:15:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,555 INFO L388 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 [2021-11-04 00:15:49,600 INFO L388 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 21 treesize of output 9 [2021-11-04 00:15:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,836 INFO L354 Elim1Store]: treesize reduction 207, result has 21.3 percent of original size [2021-11-04 00:15:49,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 115 [2021-11-04 00:15:49,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,893 INFO L354 Elim1Store]: treesize reduction 97, result has 28.1 percent of original size [2021-11-04 00:15:49,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 104 [2021-11-04 00:15:49,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:49,921 INFO L354 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2021-11-04 00:15:49,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 89 [2021-11-04 00:15:50,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:50,364 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-04 00:15:50,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 101 [2021-11-04 00:15:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:50,707 INFO L354 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2021-11-04 00:15:50,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 115 [2021-11-04 00:15:52,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:52,888 INFO L354 Elim1Store]: treesize reduction 92, result has 24.0 percent of original size [2021-11-04 00:15:52,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 129 [2021-11-04 00:15:53,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:53,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:54,112 INFO L354 Elim1Store]: treesize reduction 512, result has 24.8 percent of original size [2021-11-04 00:15:54,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 129 treesize of output 236 [2021-11-04 00:15:55,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:55,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:15:56,201 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:15:56,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:16:16,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:16,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:16,413 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:16:16,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:16:26,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:26,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:26,915 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:16:26,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:16:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:51,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:16:51,501 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:16:51,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:17:10,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:17:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:17:10,625 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:17:10,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:17:35,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:17:35,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:17:36,358 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:17:36,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:18:00,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:18:00,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:18:01,231 INFO L354 Elim1Store]: treesize reduction 538, result has 36.3 percent of original size [2021-11-04 00:18:01,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:18:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:18:20,848 INFO L354 Elim1Store]: treesize reduction 580, result has 35.1 percent of original size [2021-11-04 00:18:20,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 47 case distinctions, treesize of input 226 treesize of output 464 [2021-11-04 00:18:49,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 00:18:49,471 INFO L388 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 21 treesize of output 20 [2021-11-04 00:18:49,758 INFO L354 Elim1Store]: treesize reduction 132, result has 16.5 percent of original size [2021-11-04 00:18:49,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2021-11-04 00:18:52,412 INFO L354 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2021-11-04 00:18:52,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 46 [2021-11-04 00:18:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-04 00:18:52,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:22:18,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |c_ULTIMATE.start_#Ultimate.C_memset_#value|)))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)) is different from false [2021-11-04 00:23:52,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_memset_#ptr.base|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|)))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)) is different from false [2021-11-04 00:23:54,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int)) (or (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|)))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)))) is different from false [2021-11-04 00:23:56,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int) (v_DerPreprocessor_4 Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int)) (or (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select |c_#memory_int| c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 202) v_DerPreprocessor_4)))) (store .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|))))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0))) is different from false [2021-11-04 00:24:00,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int) (v_DerPreprocessor_4 Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int)) (or (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (= 0 (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_ULTIMATE.start_usb_fill_int_urb_~urb.base (store (select |c_#memory_int| c_ULTIMATE.start_usb_fill_int_urb_~urb.base) (+ 148 c_ULTIMATE.start_usb_fill_int_urb_~urb.offset) (- 1))))) (store .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 202) v_DerPreprocessor_4))))) (store .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|))))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|)))) is different from false [2021-11-04 00:24:02,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (v_~shiftLeft_9 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int) (v_DerPreprocessor_4 Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int)) (or (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_ULTIMATE.start_usb_fill_int_urb_~urb.base (store (store (select |c_#memory_int| c_ULTIMATE.start_usb_fill_int_urb_~urb.base) (+ 156 c_ULTIMATE.start_usb_fill_int_urb_~urb.offset) v_~shiftLeft_9) (+ 148 c_ULTIMATE.start_usb_fill_int_urb_~urb.offset) (- 1))))) (store .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 202) v_DerPreprocessor_4))))) (store .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|))))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0))) is different from false [2021-11-04 00:24:07,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (v_ULTIMATE.start_usb_fill_int_urb_~pipe_5 Int) (v_~shiftLeft_9 Int) (v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_usb_fill_int_urb_~buffer_length_5 Int) (v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int)) (or (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 185)) v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13 (store (store (store (store (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13) (+ 64 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_DerPreprocessor_8) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 80) v_ULTIMATE.start_usb_fill_int_urb_~pipe_5) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 96) v_DerPreprocessor_7) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 124) v_ULTIMATE.start_usb_fill_int_urb_~buffer_length_5) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 172) v_DerPreprocessor_6) (+ 164 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_DerPreprocessor_5) (+ 156 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_~shiftLeft_9) (+ 148 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) (- 1))))) (store .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select .cse3 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 202) v_DerPreprocessor_4))))) (store .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select .cse2 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|))))) (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse1 (store (select .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse1 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse0 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse1) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0) (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|))) is different from false [2021-11-04 00:24:16,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_iowarrior_probe_~interface.offset Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| Int) (ULTIMATE.start_iowarrior_probe_~interface.base Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| Int) (|ULTIMATE.start_#Ultimate.C_memset_#ptr.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| Int) (v_ULTIMATE.start_usb_fill_int_urb_~pipe_5 Int) (v_~shiftLeft_9 Int) (v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_usb_fill_int_urb_~buffer_length_5 Int) (v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 Int) (|ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| Int) (|ULTIMATE.start_#Ultimate.C_memset_#value| Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_iowarrior_probe_~tmp___11~2.base_4 Int) (|v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| Int)) (let ((.cse0 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 193))) (or (< c_ULTIMATE.start_iowarrior_probe_~dev~8.base |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (< (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_iowarrior_probe_~dev~8.base) .cse0 v_ULTIMATE.start_iowarrior_probe_~tmp___11~2.base_4) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 185)) v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13) (= (select (select (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select |c_#memory_int| c_ULTIMATE.start_iowarrior_probe_~dev~8.base) .cse0 v_DerPreprocessor_9)))) (store .cse5 v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13 (store (store (store (store (store (store (store (store (select .cse5 v_ULTIMATE.start_usb_fill_int_urb_~urb.base_13) (+ 64 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_DerPreprocessor_8) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 80) v_ULTIMATE.start_usb_fill_int_urb_~pipe_5) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 96) v_DerPreprocessor_7) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 124) v_ULTIMATE.start_usb_fill_int_urb_~buffer_length_5) (+ v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13 172) v_DerPreprocessor_6) (+ 164 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_DerPreprocessor_5) (+ 156 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) v_~shiftLeft_9) (+ 148 v_ULTIMATE.start_usb_fill_int_urb_~urb.offset_13) (- 1)))))) (store .cse4 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (store (select .cse4 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 202) v_DerPreprocessor_4))))) (store .cse3 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12| (store (store (store (store (store (store (store (store (store (select .cse3 |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_12|) (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_53| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_51| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_49| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_47| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_45| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_43| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_41| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|) (+ |v_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr381_39| |ULTIMATE.start_#Ultimate.C_memset_#ptr.offset|) |ULTIMATE.start_#Ultimate.C_memset_#value|))))) (store .cse1 c_ULTIMATE.start_iowarrior_probe_~dev~8.base (let ((.cse2 (store (select .cse1 c_ULTIMATE.start_iowarrior_probe_~dev~8.base) (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 450) 1))) (store .cse2 (+ c_ULTIMATE.start_iowarrior_probe_~dev~8.offset 168) (select (select (store .cse1 c_ULTIMATE.start_iowarrior_probe_~dev~8.base .cse2) ULTIMATE.start_iowarrior_probe_~interface.base) (+ 28 ULTIMATE.start_iowarrior_probe_~interface.offset)))))) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)))) is different from false Killed by 15