./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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-net-usb-catc.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 14:02:06,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 14:02:06,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 14:02:06,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 14:02:06,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 14:02:06,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 14:02:06,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 14:02:06,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 14:02:06,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 14:02:06,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 14:02:06,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 14:02:06,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 14:02:06,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 14:02:06,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 14:02:06,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 14:02:06,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 14:02:06,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 14:02:06,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 14:02:06,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 14:02:06,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 14:02:06,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 14:02:06,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 14:02:06,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 14:02:06,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 14:02:06,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 14:02:06,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 14:02:06,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 14:02:06,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 14:02:06,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 14:02:06,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 14:02:06,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 14:02:06,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 14:02:06,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 14:02:06,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 14:02:06,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 14:02:06,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 14:02:06,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 14:02:06,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 14:02:06,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 14:02:06,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 14:02:06,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 14:02:06,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 14:02:06,311 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 14:02:06,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 14:02:06,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 14:02:06,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 14:02:06,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 14:02:06,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 14:02:06,314 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 14:02:06,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 14:02:06,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 14:02:06,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 14:02:06,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 14:02:06,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 14:02:06,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 14:02:06,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 14:02:06,316 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 14:02:06,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 14:02:06,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 14:02:06,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 14:02:06,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 14:02:06,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:02:06,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 14:02:06,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 14:02:06,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 14:02:06,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 14:02:06,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 14:02:06,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 14:02:06,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 14:02:06,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 14:02:06,325 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 14:02:06,325 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-05 14:02:06,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 14:02:06,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 14:02:06,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 14:02:06,663 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 14:02:06,664 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 14:02:06,666 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-net-usb-catc.ko.cil.out.i [2021-11-05 14:02:06,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13767a6f/96663689bc7a42bf90c0780d317f3f3d/FLAG9779491dc [2021-11-05 14:02:07,473 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 14:02:07,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-05 14:02:07,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13767a6f/96663689bc7a42bf90c0780d317f3f3d/FLAG9779491dc [2021-11-05 14:02:07,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13767a6f/96663689bc7a42bf90c0780d317f3f3d [2021-11-05 14:02:07,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 14:02:07,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 14:02:07,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 14:02:07,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 14:02:07,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 14:02:07,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:02:07" (1/1) ... [2021-11-05 14:02:07,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319b55b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:07, skipping insertion in model container [2021-11-05 14:02:07,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:02:07" (1/1) ... [2021-11-05 14:02:07,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 14:02:07,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 14:02:08,825 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-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-05 14:02:08,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:02:08,937 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 14:02:09,159 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-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-05 14:02:09,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:02:09,443 INFO L208 MainTranslator]: Completed translation [2021-11-05 14:02:09,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09 WrapperNode [2021-11-05 14:02:09,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 14:02:09,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 14:02:09,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 14:02:09,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 14:02:09,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 14:02:09,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 14:02:09,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 14:02:09,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 14:02:09,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 14:02:09,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 14:02:09,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 14:02:09,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 14:02:09,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (1/1) ... [2021-11-05 14:02:09,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:02:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:02:09,864 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-05 14:02:09,888 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-05 14:02:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 14:02:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 14:02:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 14:02:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 14:02:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 14:02:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 14:02:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 14:02:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-05 14:02:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 14:02:09,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 14:02:10,313 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-05 14:02:10,374 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-05 14:02:13,633 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-05 14:02:13,633 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-05 14:02:13,633 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-05 14:02:13,633 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-05 14:02:13,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 14:02:13,644 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-05 14:02:13,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:02:13 BoogieIcfgContainer [2021-11-05 14:02:13,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 14:02:13,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 14:02:13,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 14:02:13,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 14:02:13,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 02:02:07" (1/3) ... [2021-11-05 14:02:13,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28062898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:02:13, skipping insertion in model container [2021-11-05 14:02:13,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:09" (2/3) ... [2021-11-05 14:02:13,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28062898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:02:13, skipping insertion in model container [2021-11-05 14:02:13,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:02:13" (3/3) ... [2021-11-05 14:02:13,653 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-05 14:02:13,657 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 14:02:13,657 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-05 14:02:13,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 14:02:13,704 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-05 14:02:13,705 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-05 14:02:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-05 14:02:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-05 14:02:13,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:13,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:02:13,731 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-05 14:02:13,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:13,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048530861] [2021-11-05 14:02:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:13,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:14,174 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-05 14:02:14,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:14,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048530861] [2021-11-05 14:02:14,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048530861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:14,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:14,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 14:02:14,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597372581] [2021-11-05 14:02:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:14,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:02:14,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:02:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:14,229 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-05 14:02:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:14,503 INFO L93 Difference]: Finished difference Result 2020 states and 2970 transitions. [2021-11-05 14:02:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:02:14,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-05 14:02:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:14,549 INFO L225 Difference]: With dead ends: 2020 [2021-11-05 14:02:14,549 INFO L226 Difference]: Without dead ends: 1312 [2021-11-05 14:02:14,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.39ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:14,567 INFO L933 BasicCegarLoop]: 858 mSDtfsCounter, 836 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.71ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.55ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:14,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 1674 Invalid, 71 Unknown, 0 Unchecked, 17.71ms Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 97.55ms Time] [2021-11-05 14:02:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-05 14:02:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1288. [2021-11-05 14:02:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1274 states have (on average 1.2896389324960753) internal successors, (1643), 1287 states have internal predecessors, (1643), 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-05 14:02:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1643 transitions. [2021-11-05 14:02:14,707 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1643 transitions. Word has length 11 [2021-11-05 14:02:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:14,707 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 1643 transitions. [2021-11-05 14:02:14,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-05 14:02:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1643 transitions. [2021-11-05 14:02:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-05 14:02:14,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:14,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:02:14,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 14:02:14,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 45356904, now seen corresponding path program 1 times [2021-11-05 14:02:14,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:14,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671838042] [2021-11-05 14:02:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:14,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:14,864 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-05 14:02:14,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:14,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671838042] [2021-11-05 14:02:14,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671838042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:14,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:14,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 14:02:14,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413490266] [2021-11-05 14:02:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:14,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:02:14,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:02:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:14,869 INFO L87 Difference]: Start difference. First operand 1288 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 14:02:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:14,916 INFO L93 Difference]: Finished difference Result 1288 states and 1643 transitions. [2021-11-05 14:02:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:02:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-05 14:02:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:14,922 INFO L225 Difference]: With dead ends: 1288 [2021-11-05 14:02:14,922 INFO L226 Difference]: Without dead ends: 1283 [2021-11-05 14:02:14,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.84ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:14,928 INFO L933 BasicCegarLoop]: 845 mSDtfsCounter, 835 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:14,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 4.11ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 14:02:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-05 14:02:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-05 14:02:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1270 states have (on average 1.2858267716535432) internal successors, (1633), 1282 states have internal predecessors, (1633), 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-05 14:02:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-05 14:02:14,978 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-05 14:02:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:14,979 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-05 14:02:14,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 14:02:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-05 14:02:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-05 14:02:14,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:14,982 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-05 14:02:14,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 14:02:14,987 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-05 14:02:14,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:14,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560416896] [2021-11-05 14:02:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:14,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:15,119 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-05 14:02:15,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:15,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560416896] [2021-11-05 14:02:15,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560416896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:15,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:15,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:02:15,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591984816] [2021-11-05 14:02:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:15,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:02:15,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:02:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:15,123 INFO L87 Difference]: Start difference. First operand 1283 states and 1633 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-05 14:02:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:15,223 INFO L93 Difference]: Finished difference Result 3119 states and 4010 transitions. [2021-11-05 14:02:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:02:15,224 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-05 14:02:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:15,231 INFO L225 Difference]: With dead ends: 3119 [2021-11-05 14:02:15,231 INFO L226 Difference]: Without dead ends: 1844 [2021-11-05 14:02:15,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.80ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:15,241 INFO L933 BasicCegarLoop]: 842 mSDtfsCounter, 768 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.54ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.96ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:15,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 1270 Invalid, 15 Unknown, 0 Unchecked, 5.54ms Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 17.96ms Time] [2021-11-05 14:02:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2021-11-05 14:02:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1840. [2021-11-05 14:02:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1827 states have (on average 1.30103995621237) internal successors, (2377), 1839 states have internal predecessors, (2377), 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-05 14:02:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2377 transitions. [2021-11-05 14:02:15,299 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2377 transitions. Word has length 35 [2021-11-05 14:02:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:15,300 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2377 transitions. [2021-11-05 14:02:15,300 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-05 14:02:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2377 transitions. [2021-11-05 14:02:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-05 14:02:15,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:15,309 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] [2021-11-05 14:02:15,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 14:02:15,309 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-05 14:02:15,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:15,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201517553] [2021-11-05 14:02:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:15,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:15,403 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-05 14:02:15,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:15,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201517553] [2021-11-05 14:02:15,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201517553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:15,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:15,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:02:15,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308075771] [2021-11-05 14:02:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:15,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:02:15,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:15,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:02:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:02:15,406 INFO L87 Difference]: Start difference. First operand 1840 states and 2377 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-05 14:02:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:15,631 INFO L93 Difference]: Finished difference Result 3679 states and 4752 transitions. [2021-11-05 14:02:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:02:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-05 14:02:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:15,638 INFO L225 Difference]: With dead ends: 3679 [2021-11-05 14:02:15,639 INFO L226 Difference]: Without dead ends: 1842 [2021-11-05 14:02:15,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.29ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:15,642 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 9 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.85ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.88ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:15,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 2516 Invalid, 12 Unknown, 0 Unchecked, 2.85ms Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 161.88ms Time] [2021-11-05 14:02:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-05 14:02:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1838. [2021-11-05 14:02:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1825 states have (on average 1.2991780821917809) internal successors, (2371), 1837 states have internal predecessors, (2371), 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-05 14:02:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2371 transitions. [2021-11-05 14:02:15,696 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2371 transitions. Word has length 53 [2021-11-05 14:02:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:15,696 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2371 transitions. [2021-11-05 14:02:15,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-05 14:02:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2371 transitions. [2021-11-05 14:02:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:02:15,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:15,699 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] [2021-11-05 14:02:15,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 14:02:15,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-05 14:02:15,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:15,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202538552] [2021-11-05 14:02:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:15,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:15,870 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-05 14:02:15,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:15,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202538552] [2021-11-05 14:02:15,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202538552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:15,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:15,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:15,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224197471] [2021-11-05 14:02:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:15,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:15,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:15,873 INFO L87 Difference]: Start difference. First operand 1838 states and 2371 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:16,097 INFO L93 Difference]: Finished difference Result 5464 states and 7047 transitions. [2021-11-05 14:02:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:02:16,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-05 14:02:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:16,115 INFO L225 Difference]: With dead ends: 5464 [2021-11-05 14:02:16,115 INFO L226 Difference]: Without dead ends: 3632 [2021-11-05 14:02:16,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.62ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:02:16,125 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 817 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.85ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.51ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:16,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 4467 Invalid, 61 Unknown, 0 Unchecked, 6.85ms Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 85.51ms Time] [2021-11-05 14:02:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2021-11-05 14:02:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1841. [2021-11-05 14:02:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1828 states have (on average 1.298140043763676) internal successors, (2373), 1840 states have internal predecessors, (2373), 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-05 14:02:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2373 transitions. [2021-11-05 14:02:16,212 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2373 transitions. Word has length 78 [2021-11-05 14:02:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:16,214 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2373 transitions. [2021-11-05 14:02:16,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2373 transitions. [2021-11-05 14:02:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:02:16,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:16,217 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] [2021-11-05 14:02:16,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 14:02:16,217 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-05 14:02:16,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:16,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963133252] [2021-11-05 14:02:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:16,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:16,370 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-05 14:02:16,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:16,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963133252] [2021-11-05 14:02:16,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963133252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:16,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:16,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:16,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452779647] [2021-11-05 14:02:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:16,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:16,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:16,373 INFO L87 Difference]: Start difference. First operand 1841 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:16,652 INFO L93 Difference]: Finished difference Result 5587 states and 7218 transitions. [2021-11-05 14:02:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:02:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-05 14:02:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:16,667 INFO L225 Difference]: With dead ends: 5587 [2021-11-05 14:02:16,667 INFO L226 Difference]: Without dead ends: 3755 [2021-11-05 14:02:16,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.05ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:02:16,672 INFO L933 BasicCegarLoop]: 1736 mSDtfsCounter, 3573 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 5484 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.43ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.72ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:16,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 5484 Invalid, 99 Unknown, 0 Unchecked, 10.43ms Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 68.72ms Time] [2021-11-05 14:02:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-11-05 14:02:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1853. [2021-11-05 14:02:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.296195652173913) internal successors, (2385), 1852 states have internal predecessors, (2385), 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-05 14:02:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2385 transitions. [2021-11-05 14:02:16,767 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2385 transitions. Word has length 78 [2021-11-05 14:02:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:16,767 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2385 transitions. [2021-11-05 14:02:16,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2385 transitions. [2021-11-05 14:02:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:02:16,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:16,769 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] [2021-11-05 14:02:16,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 14:02:16,770 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-05 14:02:16,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:16,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075762637] [2021-11-05 14:02:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:16,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:16,923 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-05 14:02:16,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:16,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075762637] [2021-11-05 14:02:16,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075762637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:16,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:16,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:16,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139631930] [2021-11-05 14:02:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:16,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:16,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:16,926 INFO L87 Difference]: Start difference. First operand 1853 states and 2385 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:22,486 INFO L93 Difference]: Finished difference Result 3616 states and 4663 transitions. [2021-11-05 14:02:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-05 14:02:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:22,500 INFO L225 Difference]: With dead ends: 3616 [2021-11-05 14:02:22,500 INFO L226 Difference]: Without dead ends: 3554 [2021-11-05 14:02:22,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.71ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:02:22,502 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 725 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5060.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.75ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5374.58ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:22,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 4613 Invalid, 912 Unknown, 0 Unchecked, 11.75ms Time], IncrementalHoareTripleChecker [15 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 5374.58ms Time] [2021-11-05 14:02:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2021-11-05 14:02:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 1853. [2021-11-05 14:02:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.295108695652174) internal successors, (2383), 1852 states have internal predecessors, (2383), 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-05 14:02:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2383 transitions. [2021-11-05 14:02:22,597 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2383 transitions. Word has length 78 [2021-11-05 14:02:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:22,597 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2383 transitions. [2021-11-05 14:02:22,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:02:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2383 transitions. [2021-11-05 14:02:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:02:22,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:22,599 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-05 14:02:22,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 14:02:22,599 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-05 14:02:22,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:22,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939294300] [2021-11-05 14:02:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:22,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:22,795 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-05 14:02:22,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:22,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939294300] [2021-11-05 14:02:22,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939294300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:22,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:22,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:02:22,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238178291] [2021-11-05 14:02:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:22,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:02:22,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:02:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:02:22,798 INFO L87 Difference]: Start difference. First operand 1853 states and 2383 transitions. Second operand has 4 states, 4 states have (on average 19.75) 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-05 14:02:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:23,169 INFO L93 Difference]: Finished difference Result 2830 states and 3618 transitions. [2021-11-05 14:02:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:02:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) 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-05 14:02:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:23,179 INFO L225 Difference]: With dead ends: 2830 [2021-11-05 14:02:23,179 INFO L226 Difference]: Without dead ends: 2806 [2021-11-05 14:02:23,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.04ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:02:23,181 INFO L933 BasicCegarLoop]: 1565 mSDtfsCounter, 1514 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 210.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.67ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 243.29ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:23,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 3157 Invalid, 150 Unknown, 0 Unchecked, 4.67ms Time], IncrementalHoareTripleChecker [30 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 243.29ms Time] [2021-11-05 14:02:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-11-05 14:02:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2756. [2021-11-05 14:02:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2743 states have (on average 1.2967553773240976) internal successors, (3557), 2755 states have internal predecessors, (3557), 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-05 14:02:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3557 transitions. [2021-11-05 14:02:23,302 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3557 transitions. Word has length 79 [2021-11-05 14:02:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:23,304 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 3557 transitions. [2021-11-05 14:02:23,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) 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-05 14:02:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3557 transitions. [2021-11-05 14:02:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:02:23,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:23,308 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-05 14:02:23,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 14:02:23,308 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-05 14:02:23,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:23,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5607400] [2021-11-05 14:02:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:23,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:23,527 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-05 14:02:23,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:23,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5607400] [2021-11-05 14:02:23,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5607400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:23,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:23,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:23,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203547852] [2021-11-05 14:02:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:23,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:23,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:23,531 INFO L87 Difference]: Start difference. First operand 2756 states and 3557 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:02:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:26,347 INFO L93 Difference]: Finished difference Result 6794 states and 8773 transitions. [2021-11-05 14:02:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:02:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:26,359 INFO L225 Difference]: With dead ends: 6794 [2021-11-05 14:02:26,359 INFO L226 Difference]: Without dead ends: 3952 [2021-11-05 14:02:26,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.17ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:02:26,364 INFO L933 BasicCegarLoop]: 1254 mSDtfsCounter, 802 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2494.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.22ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2648.05ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:26,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 4267 Invalid, 356 Unknown, 0 Unchecked, 6.22ms Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 2648.05ms Time] [2021-11-05 14:02:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2021-11-05 14:02:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2144. [2021-11-05 14:02:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2131 states have (on average 1.302674800563116) internal successors, (2776), 2143 states have internal predecessors, (2776), 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-05 14:02:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2776 transitions. [2021-11-05 14:02:26,488 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2776 transitions. Word has length 79 [2021-11-05 14:02:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:26,488 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 2776 transitions. [2021-11-05 14:02:26,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:02:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2776 transitions. [2021-11-05 14:02:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-05 14:02:26,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:26,492 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] [2021-11-05 14:02:26,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 14:02:26,492 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-05 14:02:26,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:26,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480307845] [2021-11-05 14:02:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:26,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:26,648 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-05 14:02:26,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:26,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480307845] [2021-11-05 14:02:26,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480307845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:26,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:26,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:26,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920969479] [2021-11-05 14:02:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:26,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:26,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:26,651 INFO L87 Difference]: Start difference. First operand 2144 states and 2776 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-05 14:02:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:30,970 INFO L93 Difference]: Finished difference Result 3914 states and 5068 transitions. [2021-11-05 14:02:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2021-11-05 14:02:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:30,985 INFO L225 Difference]: With dead ends: 3914 [2021-11-05 14:02:30,986 INFO L226 Difference]: Without dead ends: 3859 [2021-11-05 14:02:30,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.51ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:02:30,988 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 726 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3918.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.97ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4176.51ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:30,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 4598 Invalid, 915 Unknown, 0 Unchecked, 6.97ms Time], IncrementalHoareTripleChecker [17 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 4176.51ms Time] [2021-11-05 14:02:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2021-11-05 14:02:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 2149. [2021-11-05 14:02:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2136 states have (on average 1.301498127340824) internal successors, (2780), 2148 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-05 14:02:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2780 transitions. [2021-11-05 14:02:31,142 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2780 transitions. Word has length 85 [2021-11-05 14:02:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:31,142 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2780 transitions. [2021-11-05 14:02:31,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-05 14:02:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2780 transitions. [2021-11-05 14:02:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 14:02:31,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:31,144 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] [2021-11-05 14:02:31,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 14:02:31,145 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-05 14:02:31,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:31,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877763229] [2021-11-05 14:02:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:31,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:31,362 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-05 14:02:31,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:31,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877763229] [2021-11-05 14:02:31,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877763229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:31,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:31,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:31,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660823869] [2021-11-05 14:02:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:31,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:31,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:31,365 INFO L87 Difference]: Start difference. First operand 2149 states and 2780 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:02:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:33,849 INFO L93 Difference]: Finished difference Result 5857 states and 7558 transitions. [2021-11-05 14:02:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2021-11-05 14:02:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:33,860 INFO L225 Difference]: With dead ends: 5857 [2021-11-05 14:02:33,860 INFO L226 Difference]: Without dead ends: 3975 [2021-11-05 14:02:33,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.84ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:02:33,866 INFO L933 BasicCegarLoop]: 1230 mSDtfsCounter, 817 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2176.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.31ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2321.30ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:33,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 4201 Invalid, 354 Unknown, 0 Unchecked, 5.31ms Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 2321.30ms Time] [2021-11-05 14:02:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2021-11-05 14:02:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2169. [2021-11-05 14:02:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.3000927643784788) internal successors, (2803), 2168 states have internal predecessors, (2803), 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-05 14:02:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2803 transitions. [2021-11-05 14:02:33,994 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2803 transitions. Word has length 86 [2021-11-05 14:02:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:33,994 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2803 transitions. [2021-11-05 14:02:33,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:02:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2803 transitions. [2021-11-05 14:02:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 14:02:33,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:33,996 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] [2021-11-05 14:02:33,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 14:02:33,997 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1782949196, now seen corresponding path program 1 times [2021-11-05 14:02:33,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:33,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087798757] [2021-11-05 14:02:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:33,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:34,094 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-05 14:02:34,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:34,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087798757] [2021-11-05 14:02:34,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087798757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:34,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:34,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:34,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548060029] [2021-11-05 14:02:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:34,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:34,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:34,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:34,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:34,097 INFO L87 Difference]: Start difference. First operand 2169 states and 2803 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:02:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:34,449 INFO L93 Difference]: Finished difference Result 7126 states and 9227 transitions. [2021-11-05 14:02:34,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2021-11-05 14:02:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:34,458 INFO L225 Difference]: With dead ends: 7126 [2021-11-05 14:02:34,459 INFO L226 Difference]: Without dead ends: 5242 [2021-11-05 14:02:34,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.98ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:02:34,462 INFO L933 BasicCegarLoop]: 1226 mSDtfsCounter, 3691 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 4858 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.82ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.36ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:34,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3691 Valid, 4858 Invalid, 88 Unknown, 0 Unchecked, 24.82ms Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 69.36ms Time] [2021-11-05 14:02:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-05 14:02:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2169. [2021-11-05 14:02:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.2954545454545454) internal successors, (2793), 2168 states have internal predecessors, (2793), 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-05 14:02:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2793 transitions. [2021-11-05 14:02:34,576 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2793 transitions. Word has length 86 [2021-11-05 14:02:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:34,576 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2793 transitions. [2021-11-05 14:02:34,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:02:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2793 transitions. [2021-11-05 14:02:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 14:02:34,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:34,578 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] [2021-11-05 14:02:34,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 14:02:34,579 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 268034802, now seen corresponding path program 1 times [2021-11-05 14:02:34,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:34,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797896469] [2021-11-05 14:02:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:34,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:34,717 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-05 14:02:34,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:34,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797896469] [2021-11-05 14:02:34,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797896469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:34,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:34,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:02:34,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602388709] [2021-11-05 14:02:34,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:34,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:34,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:34,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:34,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:34,720 INFO L87 Difference]: Start difference. First operand 2169 states and 2793 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-05 14:02:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:35,371 INFO L93 Difference]: Finished difference Result 3541 states and 4547 transitions. [2021-11-05 14:02:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:02:35,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2021-11-05 14:02:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:35,379 INFO L225 Difference]: With dead ends: 3541 [2021-11-05 14:02:35,379 INFO L226 Difference]: Without dead ends: 3486 [2021-11-05 14:02:35,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.62ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:35,381 INFO L933 BasicCegarLoop]: 1213 mSDtfsCounter, 1613 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 370.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.96ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 420.25ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:35,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 4000 Invalid, 185 Unknown, 0 Unchecked, 4.96ms Time], IncrementalHoareTripleChecker [39 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 420.25ms Time] [2021-11-05 14:02:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-11-05 14:02:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2214. [2021-11-05 14:02:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2201 states have (on average 1.2925942753293957) internal successors, (2845), 2213 states have internal predecessors, (2845), 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-05 14:02:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2845 transitions. [2021-11-05 14:02:35,525 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2845 transitions. Word has length 86 [2021-11-05 14:02:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:35,526 INFO L470 AbstractCegarLoop]: Abstraction has 2214 states and 2845 transitions. [2021-11-05 14:02:35,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-05 14:02:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2845 transitions. [2021-11-05 14:02:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-05 14:02:35,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:35,528 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, 1, 1, 1, 1] [2021-11-05 14:02:35,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 14:02:35,528 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:35,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-05 14:02:35,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:35,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747132755] [2021-11-05 14:02:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:35,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:35,646 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-05 14:02:35,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:35,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747132755] [2021-11-05 14:02:35,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747132755] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:35,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:35,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:35,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271653904] [2021-11-05 14:02:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:35,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:35,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:35,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:35,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:35,649 INFO L87 Difference]: Start difference. First operand 2214 states and 2845 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-05 14:02:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:40,846 INFO L93 Difference]: Finished difference Result 4028 states and 5175 transitions. [2021-11-05 14:02:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2021-11-05 14:02:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:40,854 INFO L225 Difference]: With dead ends: 4028 [2021-11-05 14:02:40,854 INFO L226 Difference]: Without dead ends: 3967 [2021-11-05 14:02:40,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.84ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:02:40,855 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 728 mSDsluCounter, 3048 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4665.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 4596 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.30ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4948.64ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:40,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 4596 Invalid, 917 Unknown, 0 Unchecked, 7.30ms Time], IncrementalHoareTripleChecker [18 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 4948.64ms Time] [2021-11-05 14:02:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-05 14:02:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 2225. [2021-11-05 14:02:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2212 states have (on average 1.2915913200723328) internal successors, (2857), 2224 states have internal predecessors, (2857), 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-05 14:02:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2857 transitions. [2021-11-05 14:02:40,990 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2857 transitions. Word has length 92 [2021-11-05 14:02:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:40,990 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2857 transitions. [2021-11-05 14:02:40,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-05 14:02:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2857 transitions. [2021-11-05 14:02:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-05 14:02:40,992 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:40,992 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, 1, 1, 1, 1, 1] [2021-11-05 14:02:40,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 14:02:40,993 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-05 14:02:40,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:40,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710426838] [2021-11-05 14:02:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:40,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:41,137 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-05 14:02:41,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:41,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710426838] [2021-11-05 14:02:41,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710426838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:41,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:41,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:41,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823173837] [2021-11-05 14:02:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:41,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:41,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:41,140 INFO L87 Difference]: Start difference. First operand 2225 states and 2857 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:02:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:43,739 INFO L93 Difference]: Finished difference Result 6090 states and 7800 transitions. [2021-11-05 14:02:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:02:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-05 14:02:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:43,747 INFO L225 Difference]: With dead ends: 6090 [2021-11-05 14:02:43,747 INFO L226 Difference]: Without dead ends: 4138 [2021-11-05 14:02:43,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.31ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:02:43,751 INFO L933 BasicCegarLoop]: 1235 mSDtfsCounter, 839 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2234.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.75ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2379.51ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:43,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 4214 Invalid, 361 Unknown, 0 Unchecked, 4.75ms Time], IncrementalHoareTripleChecker [7 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 2379.51ms Time] [2021-11-05 14:02:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2021-11-05 14:02:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2236. [2021-11-05 14:02:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2223 states have (on average 1.2905982905982907) internal successors, (2869), 2235 states have internal predecessors, (2869), 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-05 14:02:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2869 transitions. [2021-11-05 14:02:43,933 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2869 transitions. Word has length 93 [2021-11-05 14:02:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:43,933 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2869 transitions. [2021-11-05 14:02:43,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:02:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2869 transitions. [2021-11-05 14:02:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-05 14:02:43,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:43,935 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, 1, 1, 1, 1, 1] [2021-11-05 14:02:43,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 14:02:43,936 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash 607900007, now seen corresponding path program 1 times [2021-11-05 14:02:43,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:43,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586762720] [2021-11-05 14:02:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:43,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:44,070 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-05 14:02:44,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:44,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586762720] [2021-11-05 14:02:44,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586762720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:44,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:44,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:44,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545388687] [2021-11-05 14:02:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:44,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:02:44,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:44,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:02:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:02:44,074 INFO L87 Difference]: Start difference. First operand 2236 states and 2869 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:02:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:44,506 INFO L93 Difference]: Finished difference Result 4362 states and 5593 transitions. [2021-11-05 14:02:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:02:44,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-05 14:02:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:44,514 INFO L225 Difference]: With dead ends: 4362 [2021-11-05 14:02:44,514 INFO L226 Difference]: Without dead ends: 4243 [2021-11-05 14:02:44,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.35ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:02:44,517 INFO L933 BasicCegarLoop]: 1224 mSDtfsCounter, 4100 mSDsluCounter, 2544 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 180.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 210.92ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:44,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4100 Valid, 3768 Invalid, 228 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [75 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 210.92ms Time] [2021-11-05 14:02:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2021-11-05 14:02:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2245. [2021-11-05 14:02:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2232 states have (on average 1.2898745519713262) internal successors, (2879), 2244 states have internal predecessors, (2879), 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-05 14:02:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2879 transitions. [2021-11-05 14:02:44,696 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2879 transitions. Word has length 93 [2021-11-05 14:02:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:44,696 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 2879 transitions. [2021-11-05 14:02:44,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:02:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2879 transitions. [2021-11-05 14:02:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-05 14:02:44,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:44,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:02:44,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 14:02:44,698 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-05 14:02:44,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:44,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654270873] [2021-11-05 14:02:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:44,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:44,819 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-05 14:02:44,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:44,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654270873] [2021-11-05 14:02:44,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654270873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:44,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:44,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:02:44,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824467721] [2021-11-05 14:02:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:44,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:02:44,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:44,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:02:44,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:44,822 INFO L87 Difference]: Start difference. First operand 2245 states and 2879 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-05 14:02:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:45,128 INFO L93 Difference]: Finished difference Result 4141 states and 5304 transitions. [2021-11-05 14:02:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:02:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2021-11-05 14:02:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:45,132 INFO L225 Difference]: With dead ends: 4141 [2021-11-05 14:02:45,132 INFO L226 Difference]: Without dead ends: 2190 [2021-11-05 14:02:45,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.16ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:45,138 INFO L933 BasicCegarLoop]: 1524 mSDtfsCounter, 782 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.65ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.53ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:45,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 2256 Invalid, 49 Unknown, 0 Unchecked, 2.65ms Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 51.53ms Time] [2021-11-05 14:02:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-11-05 14:02:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2180. [2021-11-05 14:02:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2167 states have (on average 1.2833410244577756) internal successors, (2781), 2179 states have internal predecessors, (2781), 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-05 14:02:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2781 transitions. [2021-11-05 14:02:45,328 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2781 transitions. Word has length 98 [2021-11-05 14:02:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:45,328 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 2781 transitions. [2021-11-05 14:02:45,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-05 14:02:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2781 transitions. [2021-11-05 14:02:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-05 14:02:45,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:45,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:02:45,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 14:02:45,331 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-05 14:02:45,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:45,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502824830] [2021-11-05 14:02:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:45,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:45,444 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-05 14:02:45,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:45,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502824830] [2021-11-05 14:02:45,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502824830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:45,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:45,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:45,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153480458] [2021-11-05 14:02:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:45,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:45,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:45,447 INFO L87 Difference]: Start difference. First operand 2180 states and 2781 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-05 14:02:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:48,067 INFO L93 Difference]: Finished difference Result 2190 states and 2788 transitions. [2021-11-05 14:02:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:02:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2021-11-05 14:02:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:48,070 INFO L225 Difference]: With dead ends: 2190 [2021-11-05 14:02:48,070 INFO L226 Difference]: Without dead ends: 2156 [2021-11-05 14:02:48,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.37ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:02:48,071 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 8 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2300.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.84ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2448.16ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:48,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2799 Invalid, 478 Unknown, 0 Unchecked, 2.84ms Time], IncrementalHoareTripleChecker [1 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2448.16ms Time] [2021-11-05 14:02:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-05 14:02:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-05 14:02:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2855140186915888) internal successors, (2751), 2151 states have internal predecessors, (2751), 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-05 14:02:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2751 transitions. [2021-11-05 14:02:48,232 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2751 transitions. Word has length 99 [2021-11-05 14:02:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:48,232 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2751 transitions. [2021-11-05 14:02:48,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-05 14:02:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2751 transitions. [2021-11-05 14:02:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-05 14:02:48,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:48,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:02:48,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-05 14:02:48,235 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-05 14:02:48,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:48,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856740639] [2021-11-05 14:02:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:48,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:48,360 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-05 14:02:48,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:48,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856740639] [2021-11-05 14:02:48,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856740639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:48,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:48,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:02:48,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673007809] [2021-11-05 14:02:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:48,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:02:48,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:48,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:02:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:02:48,363 INFO L87 Difference]: Start difference. First operand 2152 states and 2751 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 14:02:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:48,559 INFO L93 Difference]: Finished difference Result 2160 states and 2757 transitions. [2021-11-05 14:02:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:02:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2021-11-05 14:02:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:48,564 INFO L225 Difference]: With dead ends: 2160 [2021-11-05 14:02:48,564 INFO L226 Difference]: Without dead ends: 2156 [2021-11-05 14:02:48,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:48,565 INFO L933 BasicCegarLoop]: 1184 mSDtfsCounter, 1236 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.99ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:48,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 1946 Invalid, 12 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 28.99ms Time] [2021-11-05 14:02:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-05 14:02:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-05 14:02:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2845794392523364) internal successors, (2749), 2151 states have internal predecessors, (2749), 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-05 14:02:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2749 transitions. [2021-11-05 14:02:48,749 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2749 transitions. Word has length 126 [2021-11-05 14:02:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:48,750 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2749 transitions. [2021-11-05 14:02:48,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 14:02:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2749 transitions. [2021-11-05 14:02:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-05 14:02:48,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:48,752 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-05 14:02:48,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 14:02:48,753 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 451476494, now seen corresponding path program 1 times [2021-11-05 14:02:48,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:48,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983883647] [2021-11-05 14:02:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:48,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:02:48,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:48,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983883647] [2021-11-05 14:02:48,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983883647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:48,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:48,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:02:48,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614387254] [2021-11-05 14:02:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:48,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:02:48,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:02:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:48,906 INFO L87 Difference]: Start difference. First operand 2152 states and 2749 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-05 14:02:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:50,313 INFO L93 Difference]: Finished difference Result 4067 states and 5172 transitions. [2021-11-05 14:02:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:02:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 131 [2021-11-05 14:02:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:50,316 INFO L225 Difference]: With dead ends: 4067 [2021-11-05 14:02:50,316 INFO L226 Difference]: Without dead ends: 2201 [2021-11-05 14:02:50,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.37ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:02:50,319 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 53 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1155.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1241.38ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:50,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 3017 Invalid, 256 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1241.38ms Time] [2021-11-05 14:02:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-11-05 14:02:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2154. [2021-11-05 14:02:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.284780578898226) internal successors, (2752), 2153 states have internal predecessors, (2752), 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-05 14:02:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2752 transitions. [2021-11-05 14:02:50,512 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2752 transitions. Word has length 131 [2021-11-05 14:02:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:50,512 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2752 transitions. [2021-11-05 14:02:50,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-05 14:02:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2752 transitions. [2021-11-05 14:02:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-05 14:02:50,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:50,514 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-05 14:02:50,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 14:02:50,515 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -555431090, now seen corresponding path program 1 times [2021-11-05 14:02:50,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:50,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772999785] [2021-11-05 14:02:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:50,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:02:50,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:50,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772999785] [2021-11-05 14:02:50,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772999785] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 14:02:50,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444419500] [2021-11-05 14:02:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:50,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 14:02:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:02:50,695 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-05 14:02:50,746 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-05 14:02:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:51,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:02:51,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:02:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:02:51,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 14:02:51,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444419500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:51,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 14:02:51,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-05 14:02:51,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070085818] [2021-11-05 14:02:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:51,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:02:51,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:02:51,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:51,556 INFO L87 Difference]: Start difference. First operand 2154 states and 2752 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-05 14:02:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:51,721 INFO L93 Difference]: Finished difference Result 4018 states and 5120 transitions. [2021-11-05 14:02:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:02:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 131 [2021-11-05 14:02:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:51,724 INFO L225 Difference]: With dead ends: 4018 [2021-11-05 14:02:51,724 INFO L226 Difference]: Without dead ends: 2158 [2021-11-05 14:02:51,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.15ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:02:51,726 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 1063 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.38ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.48ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:51,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 1949 Invalid, 18 Unknown, 0 Unchecked, 2.38ms Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 13.48ms Time] [2021-11-05 14:02:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-11-05 14:02:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2154. [2021-11-05 14:02:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.2829131652661065) internal successors, (2748), 2153 states have internal predecessors, (2748), 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-05 14:02:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2748 transitions. [2021-11-05 14:02:51,874 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2748 transitions. Word has length 131 [2021-11-05 14:02:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:51,875 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2748 transitions. [2021-11-05 14:02:51,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-05 14:02:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2748 transitions. [2021-11-05 14:02:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-05 14:02:51,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:51,877 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:02:51,904 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-05 14:02:52,091 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,SelfDestructingSolverStorable20 [2021-11-05 14:02:52,092 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1591853852, now seen corresponding path program 1 times [2021-11-05 14:02:52,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:52,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66978603] [2021-11-05 14:02:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:52,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:02:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:02:52,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:02:52,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66978603] [2021-11-05 14:02:52,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66978603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:02:52,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:02:52,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:02:52,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525265227] [2021-11-05 14:02:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:02:52,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:02:52,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:02:52,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:02:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:52,253 INFO L87 Difference]: Start difference. First operand 2154 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-05 14:02:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:02:52,450 INFO L93 Difference]: Finished difference Result 4077 states and 5182 transitions. [2021-11-05 14:02:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:02:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2021-11-05 14:02:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:02:52,454 INFO L225 Difference]: With dead ends: 4077 [2021-11-05 14:02:52,454 INFO L226 Difference]: Without dead ends: 2217 [2021-11-05 14:02:52,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.80ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:02:52,457 INFO L933 BasicCegarLoop]: 1237 mSDtfsCounter, 720 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.69ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.90ms IncrementalHoareTripleChecker+Time [2021-11-05 14:02:52,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 1741 Invalid, 52 Unknown, 0 Unchecked, 1.69ms Time], IncrementalHoareTripleChecker [28 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 54.90ms Time] [2021-11-05 14:02:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-11-05 14:02:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2124. [2021-11-05 14:02:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2112 states have (on average 1.2727272727272727) internal successors, (2688), 2123 states have internal predecessors, (2688), 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-05 14:02:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2688 transitions. [2021-11-05 14:02:52,606 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2688 transitions. Word has length 139 [2021-11-05 14:02:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:02:52,606 INFO L470 AbstractCegarLoop]: Abstraction has 2124 states and 2688 transitions. [2021-11-05 14:02:52,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-05 14:02:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2688 transitions. [2021-11-05 14:02:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-05 14:02:52,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:02:52,608 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:02:52,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 14:02:52,609 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:02:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:02:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-05 14:02:52,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:02:52,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119321407] [2021-11-05 14:02:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:02:52,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:02:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-05 14:02:53,291 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-05 14:02:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-05 14:02:54,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-05 14:02:54,012 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-05 14:02:54,013 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (13 of 14 remaining) [2021-11-05 14:02:54,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 14 remaining) [2021-11-05 14:02:54,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 14 remaining) [2021-11-05 14:02:54,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 14 remaining) [2021-11-05 14:02:54,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 14 remaining) [2021-11-05 14:02:54,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 14 remaining) [2021-11-05 14:02:54,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 14 remaining) [2021-11-05 14:02:54,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 14 remaining) [2021-11-05 14:02:54,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 14 remaining) [2021-11-05 14:02:54,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 14 remaining) [2021-11-05 14:02:54,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 14 remaining) [2021-11-05 14:02:54,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 14 remaining) [2021-11-05 14:02:54,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 14 remaining) [2021-11-05 14:02:54,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (0 of 14 remaining) [2021-11-05 14:02:54,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-05 14:02:54,023 INFO L732 BasicCegarLoop]: Path program histogram: [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-05 14:02:54,026 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 14:02:54,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 02:02:54 BoogieIcfgContainer [2021-11-05 14:02:54,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 14:02:54,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 14:02:54,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 14:02:54,305 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 14:02:54,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:02:13" (3/4) ... [2021-11-05 14:02:54,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-05 14:02:54,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 14:02:54,309 INFO L158 Benchmark]: Toolchain (without parser) took 46567.59ms. Allocated memory was 58.7MB in the beginning and 650.1MB in the end (delta: 591.4MB). Free memory was 28.8MB in the beginning and 217.9MB in the end (delta: -189.1MB). Peak memory consumption was 401.2MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,310 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 14:02:54,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1701.23ms. Allocated memory was 58.7MB in the beginning and 127.9MB in the end (delta: 69.2MB). Free memory was 28.6MB in the beginning and 62.6MB in the end (delta: -34.0MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.99ms. Allocated memory is still 127.9MB. Free memory was 62.6MB in the beginning and 39.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,311 INFO L158 Benchmark]: Boogie Preprocessor took 199.35ms. Allocated memory is still 127.9MB. Free memory was 39.6MB in the beginning and 62.9MB in the end (delta: -23.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,311 INFO L158 Benchmark]: RCFGBuilder took 3812.75ms. Allocated memory was 127.9MB in the beginning and 245.4MB in the end (delta: 117.4MB). Free memory was 62.9MB in the beginning and 98.4MB in the end (delta: -35.5MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,312 INFO L158 Benchmark]: TraceAbstraction took 40656.14ms. Allocated memory was 245.4MB in the beginning and 650.1MB in the end (delta: 404.8MB). Free memory was 98.4MB in the beginning and 217.9MB in the end (delta: -119.6MB). Peak memory consumption was 313.4MB. Max. memory is 16.1GB. [2021-11-05 14:02:54,312 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 650.1MB. Free memory is still 217.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 14:02:54,317 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1701.23ms. Allocated memory was 58.7MB in the beginning and 127.9MB in the end (delta: 69.2MB). Free memory was 28.6MB in the beginning and 62.6MB in the end (delta: -34.0MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.99ms. Allocated memory is still 127.9MB. Free memory was 62.6MB in the beginning and 39.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.35ms. Allocated memory is still 127.9MB. Free memory was 39.6MB in the beginning and 62.9MB in the end (delta: -23.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3812.75ms. Allocated memory was 127.9MB in the beginning and 245.4MB in the end (delta: 117.4MB). Free memory was 62.9MB in the beginning and 98.4MB in the end (delta: -35.5MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40656.14ms. Allocated memory was 245.4MB in the beginning and 650.1MB in the end (delta: 404.8MB). Free memory was 98.4MB in the beginning and 217.9MB in the end (delta: -119.6MB). Peak memory consumption was 313.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 650.1MB. Free memory is still 217.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L5088] int tmp___7 ; [L7209] return __VERIFIER_nondet_int(); [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6320] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6326] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6343] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6349] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] catc->ctrl_urb [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] catc->tx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] catc->rx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] catc->irq_urb [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5148] urb->start_frame = -1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] EXPR catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6608] netdev->dev_addr [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6612] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6627] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L7138] return __VERIFIER_nondet_int(); [L6643] netdev->dev.parent = & intf->dev [L7187] return __VERIFIER_nondet_int(); [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb [L7217] return __VERIFIER_nondet_int(); [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6854] res_catc_open_15 = catc_open(var_group1) [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 689 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 40326.41ms, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 50.56ms, AutomataDifference: 31218.32ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15.79ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26255 SdHoareTripleChecker+Valid, 27062.49ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26255 mSDsluCounter, 72236 SdHoareTripleChecker+Invalid, 25294.96ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45548 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5258 IncrementalHoareTripleChecker+Invalid, 5589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 26688 mSDtfsCounter, 5258 mSolverCounterSat, 143.17ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 434.02ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2756occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 2845.99ms AutomataMinimizationTime, 22 MinimizatonAttempts, 20949 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 301.44ms SsaConstructionTime, 1896.66ms SatisfiabilityAnalysisTime, 2362.95ms InterpolantComputationTime, 2118 NumberOfCodeBlocks, 2118 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 4857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2217 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 25/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-05 14:02:54,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-net-usb-catc.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 14:02:56,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 14:02:56,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 14:02:56,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 14:02:56,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 14:02:56,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 14:02:56,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 14:02:56,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 14:02:56,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 14:02:56,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 14:02:56,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 14:02:56,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 14:02:56,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 14:02:56,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 14:02:56,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 14:02:56,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 14:02:56,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 14:02:56,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 14:02:56,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 14:02:56,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 14:02:56,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 14:02:56,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 14:02:56,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 14:02:56,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 14:02:56,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 14:02:56,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 14:02:56,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 14:02:56,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 14:02:56,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 14:02:56,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 14:02:56,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 14:02:56,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 14:02:56,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 14:02:56,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 14:02:56,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 14:02:56,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 14:02:56,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 14:02:56,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 14:02:56,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 14:02:56,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 14:02:56,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 14:02:56,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-05 14:02:56,336 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 14:02:56,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 14:02:56,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 14:02:56,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 14:02:56,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 14:02:56,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 14:02:56,340 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 14:02:56,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 14:02:56,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 14:02:56,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 14:02:56,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 14:02:56,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 14:02:56,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 14:02:56,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 14:02:56,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 14:02:56,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:02:56,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 14:02:56,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 14:02:56,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 14:02:56,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 14:02:56,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-05 14:02:56,345 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-05 14:02:56,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 14:02:56,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 14:02:56,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 14:02:56,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 14:02:56,652 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 14:02:56,653 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-net-usb-catc.ko.cil.out.i [2021-11-05 14:02:56,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630cc4a5a/399e94b959854210b33eaa5ecd6f2012/FLAG0f71734cd [2021-11-05 14:02:57,410 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 14:02:57,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-05 14:02:57,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630cc4a5a/399e94b959854210b33eaa5ecd6f2012/FLAG0f71734cd [2021-11-05 14:02:57,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630cc4a5a/399e94b959854210b33eaa5ecd6f2012 [2021-11-05 14:02:57,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 14:02:57,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 14:02:57,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 14:02:57,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 14:02:57,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 14:02:57,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:02:57" (1/1) ... [2021-11-05 14:02:57,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b627a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:57, skipping insertion in model container [2021-11-05 14:02:57,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:02:57" (1/1) ... [2021-11-05 14:02:57,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 14:02:57,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 14:02:58,640 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-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-05 14:02:58,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:02:58,743 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 14:02:58,992 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-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-05 14:02:59,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:02:59,237 INFO L208 MainTranslator]: Completed translation [2021-11-05 14:02:59,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59 WrapperNode [2021-11-05 14:02:59,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 14:02:59,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 14:02:59,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 14:02:59,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 14:02:59,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 14:02:59,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 14:02:59,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 14:02:59,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 14:02:59,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 14:02:59,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 14:02:59,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 14:02:59,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 14:02:59,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (1/1) ... [2021-11-05 14:02:59,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:02:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:02:59,724 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-05 14:02:59,752 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-05 14:02:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 14:02:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 14:02:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-05 14:02:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-05 14:02:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-05 14:02:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 14:02:59,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 14:03:00,193 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-05 14:03:00,238 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-05 14:03:26,440 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-05 14:03:26,441 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-05 14:03:26,441 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-05 14:03:26,441 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-05 14:03:26,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 14:03:26,451 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-05 14:03:26,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:03:26 BoogieIcfgContainer [2021-11-05 14:03:26,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 14:03:26,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 14:03:26,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 14:03:26,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 14:03:26,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 02:02:57" (1/3) ... [2021-11-05 14:03:26,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd13d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:03:26, skipping insertion in model container [2021-11-05 14:03:26,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:02:59" (2/3) ... [2021-11-05 14:03:26,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd13d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:03:26, skipping insertion in model container [2021-11-05 14:03:26,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:03:26" (3/3) ... [2021-11-05 14:03:26,461 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-05 14:03:26,465 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 14:03:26,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-05 14:03:26,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 14:03:26,513 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-05 14:03:26,514 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-05 14:03:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-05 14:03:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-05 14:03:26,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:26,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:03:26,540 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-05 14:03:26,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:26,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327947236] [2021-11-05 14:03:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:26,557 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:26,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:26,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-05 14:03:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:27,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 14:03:27,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:27,271 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-05 14:03:27,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:27,310 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-05 14:03:27,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:27,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327947236] [2021-11-05 14:03:27,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327947236] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:27,312 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:27,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:03:27,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242354617] [2021-11-05 14:03:27,314 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:27,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:03:27,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:03:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:03:27,340 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-05 14:03:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:27,643 INFO L93 Difference]: Finished difference Result 2054 states and 3006 transitions. [2021-11-05 14:03:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:03:27,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-11-05 14:03:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:27,668 INFO L225 Difference]: With dead ends: 2054 [2021-11-05 14:03:27,668 INFO L226 Difference]: Without dead ends: 1338 [2021-11-05 14:03:27,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.30ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:03:27,681 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 3462 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3462 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.00ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.51ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:27,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3462 Valid, 2656 Invalid, 15 Unknown, 0 Unchecked, 26.00ms Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 47.51ms Time] [2021-11-05 14:03:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2021-11-05 14:03:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 672. [2021-11-05 14:03:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 658 states have (on average 1.2917933130699089) internal successors, (850), 671 states have internal predecessors, (850), 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-05 14:03:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 850 transitions. [2021-11-05 14:03:27,794 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 850 transitions. Word has length 11 [2021-11-05 14:03:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:27,795 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 850 transitions. [2021-11-05 14:03:27,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-05 14:03:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 850 transitions. [2021-11-05 14:03:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-05 14:03:27,796 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:27,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:03:27,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:28,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:28,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1859836714, now seen corresponding path program 1 times [2021-11-05 14:03:28,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:28,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139749908] [2021-11-05 14:03:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:28,017 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:28,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:28,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-05 14:03:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:28,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:03:28,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:28,694 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-05 14:03:28,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:28,743 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-05 14:03:28,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:28,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139749908] [2021-11-05 14:03:28,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139749908] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:28,745 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:28,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-05 14:03:28,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959786107] [2021-11-05 14:03:28,745 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:28,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:03:28,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:03:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:03:28,748 INFO L87 Difference]: Start difference. First operand 672 states and 850 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-05 14:03:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:28,978 INFO L93 Difference]: Finished difference Result 1975 states and 2507 transitions. [2021-11-05 14:03:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:03:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-05 14:03:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:28,984 INFO L225 Difference]: With dead ends: 1975 [2021-11-05 14:03:28,985 INFO L226 Difference]: Without dead ends: 1315 [2021-11-05 14:03:28,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.10ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:03:28,987 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 808 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.25ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 138.02ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:28,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 1622 Invalid, 71 Unknown, 0 Unchecked, 4.25ms Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 138.02ms Time] [2021-11-05 14:03:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-11-05 14:03:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1291. [2021-11-05 14:03:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1277 states have (on average 1.2889584964761158) internal successors, (1646), 1290 states have internal predecessors, (1646), 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-05 14:03:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1646 transitions. [2021-11-05 14:03:29,043 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1646 transitions. Word has length 11 [2021-11-05 14:03:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:29,043 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1646 transitions. [2021-11-05 14:03:29,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-05 14:03:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1646 transitions. [2021-11-05 14:03:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-05 14:03:29,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:29,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:03:29,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:29,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:29,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1820364266, now seen corresponding path program 1 times [2021-11-05 14:03:29,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:29,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201644187] [2021-11-05 14:03:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:29,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:29,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:29,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-05 14:03:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:29,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:03:29,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:29,798 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-05 14:03:29,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:29,855 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-05 14:03:29,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:29,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201644187] [2021-11-05 14:03:29,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201644187] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:29,856 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:29,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-05 14:03:29,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78458975] [2021-11-05 14:03:29,856 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:29,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:03:29,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:03:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:03:29,858 INFO L87 Difference]: Start difference. First operand 1291 states and 1646 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 14:03:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:29,907 INFO L93 Difference]: Finished difference Result 1291 states and 1646 transitions. [2021-11-05 14:03:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:03:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-05 14:03:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:29,912 INFO L225 Difference]: With dead ends: 1291 [2021-11-05 14:03:29,912 INFO L226 Difference]: Without dead ends: 1286 [2021-11-05 14:03:29,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.20ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:03:29,914 INFO L933 BasicCegarLoop]: 845 mSDtfsCounter, 835 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.52ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:29,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 2.52ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 14:03:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-11-05 14:03:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1283. [2021-11-05 14:03:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1270 states have (on average 1.2858267716535432) internal successors, (1633), 1282 states have internal predecessors, (1633), 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-05 14:03:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-05 14:03:29,970 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-05 14:03:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:29,971 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-05 14:03:29,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-05 14:03:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-05 14:03:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-05 14:03:29,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:29,973 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-05 14:03:29,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:30,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:30,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-05 14:03:30,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:30,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048102196] [2021-11-05 14:03:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:30,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:30,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:30,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:30,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-05 14:03:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:30,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:03:30,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:30,842 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-05 14:03:30,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:30,960 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-05 14:03:30,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:30,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048102196] [2021-11-05 14:03:30,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048102196] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:30,961 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:30,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-05 14:03:30,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260796597] [2021-11-05 14:03:30,962 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:30,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:03:30,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:03:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:03:30,963 INFO L87 Difference]: Start difference. First operand 1283 states and 1633 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:03:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:31,164 INFO L93 Difference]: Finished difference Result 3681 states and 4764 transitions. [2021-11-05 14:03:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:03:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-05 14:03:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:31,174 INFO L225 Difference]: With dead ends: 3681 [2021-11-05 14:03:31,174 INFO L226 Difference]: Without dead ends: 2406 [2021-11-05 14:03:31,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.96ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:03:31,177 INFO L933 BasicCegarLoop]: 844 mSDtfsCounter, 1131 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.61ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.66ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:31,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1131 Valid, 2074 Invalid, 27 Unknown, 0 Unchecked, 4.61ms Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 65.66ms Time] [2021-11-05 14:03:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2021-11-05 14:03:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2398. [2021-11-05 14:03:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2385 states have (on average 1.310691823899371) internal successors, (3126), 2397 states have internal predecessors, (3126), 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-05 14:03:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3126 transitions. [2021-11-05 14:03:31,275 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3126 transitions. Word has length 35 [2021-11-05 14:03:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:31,275 INFO L470 AbstractCegarLoop]: Abstraction has 2398 states and 3126 transitions. [2021-11-05 14:03:31,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:03:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3126 transitions. [2021-11-05 14:03:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-05 14:03:31,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:31,279 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] [2021-11-05 14:03:31,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:31,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:31,494 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-05 14:03:31,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:31,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81149859] [2021-11-05 14:03:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:31,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:31,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-05 14:03:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:32,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:03:32,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:32,156 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-05 14:03:32,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:32,279 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-05 14:03:32,279 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:32,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81149859] [2021-11-05 14:03:32,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81149859] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:32,279 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:32,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-05 14:03:32,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672548079] [2021-11-05 14:03:32,280 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:32,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:03:32,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:03:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:03:32,281 INFO L87 Difference]: Start difference. First operand 2398 states and 3126 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:03:34,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:34,620 INFO L93 Difference]: Finished difference Result 4807 states and 6261 transitions. [2021-11-05 14:03:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:03:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-05 14:03:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:34,631 INFO L225 Difference]: With dead ends: 4807 [2021-11-05 14:03:34,631 INFO L226 Difference]: Without dead ends: 2410 [2021-11-05 14:03:34,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.88ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:03:34,636 INFO L933 BasicCegarLoop]: 844 mSDtfsCounter, 21 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2140.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.52ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2183.90ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:34,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 3357 Invalid, 21 Unknown, 0 Unchecked, 4.52ms Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2183.90ms Time] [2021-11-05 14:03:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-11-05 14:03:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2396. [2021-11-05 14:03:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2383 states have (on average 1.3092740243390684) internal successors, (3120), 2395 states have internal predecessors, (3120), 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-05 14:03:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3120 transitions. [2021-11-05 14:03:34,782 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3120 transitions. Word has length 53 [2021-11-05 14:03:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:34,782 INFO L470 AbstractCegarLoop]: Abstraction has 2396 states and 3120 transitions. [2021-11-05 14:03:34,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:03:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3120 transitions. [2021-11-05 14:03:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:03:34,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:34,785 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] [2021-11-05 14:03:34,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-05 14:03:35,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:35,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-05 14:03:35,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:35,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826434914] [2021-11-05 14:03:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:35,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:35,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:35,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-05 14:03:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:35,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 14:03:35,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:35,958 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-05 14:03:35,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:36,189 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-05 14:03:36,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:36,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826434914] [2021-11-05 14:03:36,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826434914] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:36,190 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:36,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:03:36,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131598358] [2021-11-05 14:03:36,190 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:36,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:03:36,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:03:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:03:36,191 INFO L87 Difference]: Start difference. First operand 2396 states and 3120 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:03:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:36,956 INFO L93 Difference]: Finished difference Result 7138 states and 9294 transitions. [2021-11-05 14:03:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:03:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-05 14:03:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:36,978 INFO L225 Difference]: With dead ends: 7138 [2021-11-05 14:03:36,978 INFO L226 Difference]: Without dead ends: 4748 [2021-11-05 14:03:36,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.92ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:03:36,988 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 817 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 426.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.83ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 472.10ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:36,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 4467 Invalid, 61 Unknown, 0 Unchecked, 13.83ms Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 472.10ms Time] [2021-11-05 14:03:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2021-11-05 14:03:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 2399. [2021-11-05 14:03:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2386 states have (on average 1.308466051969824) internal successors, (3122), 2398 states have internal predecessors, (3122), 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-05 14:03:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3122 transitions. [2021-11-05 14:03:37,209 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3122 transitions. Word has length 78 [2021-11-05 14:03:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:37,211 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 3122 transitions. [2021-11-05 14:03:37,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:03:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3122 transitions. [2021-11-05 14:03:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:03:37,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:37,214 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] [2021-11-05 14:03:37,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:37,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:37,437 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-05 14:03:37,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:37,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802826499] [2021-11-05 14:03:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:37,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:37,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:37,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-05 14:03:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:38,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 14:03:38,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:38,261 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-05 14:03:38,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:38,423 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-05 14:03:38,424 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:38,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802826499] [2021-11-05 14:03:38,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802826499] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:38,424 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:38,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:03:38,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7731038] [2021-11-05 14:03:38,424 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:38,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:03:38,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:03:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:03:38,426 INFO L87 Difference]: Start difference. First operand 2399 states and 3122 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:03:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:03:39,085 INFO L93 Difference]: Finished difference Result 6982 states and 9092 transitions. [2021-11-05 14:03:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 14:03:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-05 14:03:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:03:39,102 INFO L225 Difference]: With dead ends: 6982 [2021-11-05 14:03:39,103 INFO L226 Difference]: Without dead ends: 4592 [2021-11-05 14:03:39,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 86.26ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:03:39,108 INFO L933 BasicCegarLoop]: 1736 mSDtfsCounter, 3573 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 294.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 5484 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.74ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 333.90ms IncrementalHoareTripleChecker+Time [2021-11-05 14:03:39,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 5484 Invalid, 99 Unknown, 0 Unchecked, 10.74ms Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 333.90ms Time] [2021-11-05 14:03:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2021-11-05 14:03:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2411. [2021-11-05 14:03:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2398 states have (on average 1.3069224353628024) internal successors, (3134), 2410 states have internal predecessors, (3134), 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-05 14:03:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3134 transitions. [2021-11-05 14:03:39,269 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3134 transitions. Word has length 78 [2021-11-05 14:03:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:03:39,270 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 3134 transitions. [2021-11-05 14:03:39,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-05 14:03:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3134 transitions. [2021-11-05 14:03:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:03:39,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:03:39,272 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] [2021-11-05 14:03:39,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-05 14:03:39,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:03:39,488 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:03:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:03:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-05 14:03:39,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:03:39,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769264732] [2021-11-05 14:03:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:03:39,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:03:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:03:39,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:03:39,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-05 14:03:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:03:40,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:03:40,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:03:40,361 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 37 treesize of output 25 [2021-11-05 14:03:40,367 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 22 treesize of output 10 [2021-11-05 14:03:40,415 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-05 14:03:40,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:03:40,689 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-05 14:03:40,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:03:40,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769264732] [2021-11-05 14:03:40,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769264732] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:03:40,690 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:03:40,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:03:40,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648237352] [2021-11-05 14:03:40,690 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:03:40,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:03:40,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:03:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:03:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:03:40,691 INFO L87 Difference]: Start difference. First operand 2411 states and 3134 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-05 14:03:42,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:44,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:49,632 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:51,647 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:53,873 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:55,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:03:58,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:00,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:02,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:04,197 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:06,739 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:08,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:09,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:11,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:15,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:17,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:19,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:21,165 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:22,336 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:23,906 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:25,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:27,308 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:37,043 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:40,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:42,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:44,275 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:46,396 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:47,940 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:49,961 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:52,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:54,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:04:57,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:00,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:02,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:04,353 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:06,078 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:08,243 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:09,312 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:12,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:14,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:16,407 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:05:19,062 INFO L93 Difference]: Finished difference Result 4732 states and 6161 transitions. [2021-11-05 14:05:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:05:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 78 [2021-11-05 14:05:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:05:19,081 INFO L225 Difference]: With dead ends: 4732 [2021-11-05 14:05:19,081 INFO L226 Difference]: Without dead ends: 4670 [2021-11-05 14:05:19,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 280.14ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:05:19,083 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 729 mSDsluCounter, 3852 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 15 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95650.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 5406 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.81ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97983.95ms IncrementalHoareTripleChecker+Time [2021-11-05 14:05:19,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 5406 Invalid, 949 Unknown, 0 Unchecked, 15.81ms Time], IncrementalHoareTripleChecker [15 Valid, 918 Invalid, 16 Unknown, 0 Unchecked, 97983.95ms Time] [2021-11-05 14:05:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2021-11-05 14:05:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 2411. [2021-11-05 14:05:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2398 states have (on average 1.3060884070058383) internal successors, (3132), 2410 states have internal predecessors, (3132), 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-05 14:05:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3132 transitions. [2021-11-05 14:05:19,263 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3132 transitions. Word has length 78 [2021-11-05 14:05:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:05:19,264 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 3132 transitions. [2021-11-05 14:05:19,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-05 14:05:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3132 transitions. [2021-11-05 14:05:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:05:19,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:05:19,266 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-05 14:05:19,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-05 14:05:19,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:05:19,489 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:05:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:05:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-05 14:05:19,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:05:19,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869628996] [2021-11-05 14:05:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:05:19,491 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:05:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:05:19,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:05:19,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-05 14:05:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:05:20,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:05:20,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:05:20,395 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-05 14:05:20,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:05:20,746 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-05 14:05:20,746 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:05:20,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869628996] [2021-11-05 14:05:20,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869628996] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:05:20,747 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:05:20,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-05 14:05:20,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371305780] [2021-11-05 14:05:20,747 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:05:20,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:05:20,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:05:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:05:20,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:05:20,749 INFO L87 Difference]: Start difference. First operand 2411 states and 3132 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-05 14:05:22,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:24,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:05:25,824 INFO L93 Difference]: Finished difference Result 9667 states and 12640 transitions. [2021-11-05 14:05:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:05:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-05 14:05:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:05:25,857 INFO L225 Difference]: With dead ends: 9667 [2021-11-05 14:05:25,857 INFO L226 Difference]: Without dead ends: 8419 [2021-11-05 14:05:25,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.57ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:05:25,862 INFO L933 BasicCegarLoop]: 1603 mSDtfsCounter, 4589 mSDsluCounter, 4340 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 124 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4520.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.64ms SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4610.27ms IncrementalHoareTripleChecker+Time [2021-11-05 14:05:25,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4589 Valid, 5943 Invalid, 339 Unknown, 0 Unchecked, 7.64ms Time], IncrementalHoareTripleChecker [124 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 4610.27ms Time] [2021-11-05 14:05:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2021-11-05 14:05:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 7045. [2021-11-05 14:05:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7032 states have (on average 1.3111490329920363) internal successors, (9220), 7044 states have internal predecessors, (9220), 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-05 14:05:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9220 transitions. [2021-11-05 14:05:26,403 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9220 transitions. Word has length 79 [2021-11-05 14:05:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:05:26,404 INFO L470 AbstractCegarLoop]: Abstraction has 7045 states and 9220 transitions. [2021-11-05 14:05:26,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-05 14:05:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9220 transitions. [2021-11-05 14:05:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:05:26,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:05:26,410 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-05 14:05:26,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-05 14:05:26,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:05:26,624 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:05:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:05:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1167030794, now seen corresponding path program 1 times [2021-11-05 14:05:26,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:05:26,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953212563] [2021-11-05 14:05:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:05:26,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:05:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:05:26,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:05:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-05 14:05:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:05:27,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 14:05:27,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:05:27,430 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-05 14:05:27,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:05:27,561 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-05 14:05:27,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:05:27,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953212563] [2021-11-05 14:05:27,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953212563] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:05:27,562 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:05:27,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:05:27,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650487496] [2021-11-05 14:05:27,562 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:05:27,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:05:27,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:05:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:05:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:05:27,563 INFO L87 Difference]: Start difference. First operand 7045 states and 9220 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:05:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:05:28,703 INFO L93 Difference]: Finished difference Result 23094 states and 30270 transitions. [2021-11-05 14:05:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:05:28,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:05:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:05:28,735 INFO L225 Difference]: With dead ends: 23094 [2021-11-05 14:05:28,736 INFO L226 Difference]: Without dead ends: 16058 [2021-11-05 14:05:28,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.95ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:05:28,747 INFO L933 BasicCegarLoop]: 1256 mSDtfsCounter, 3690 mSDsluCounter, 3640 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3690 SdHoareTripleChecker+Valid, 4896 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.66ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 232.40ms IncrementalHoareTripleChecker+Time [2021-11-05 14:05:28,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3690 Valid, 4896 Invalid, 89 Unknown, 0 Unchecked, 5.66ms Time], IncrementalHoareTripleChecker [16 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 232.40ms Time] [2021-11-05 14:05:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16058 states. [2021-11-05 14:05:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16058 to 7045. [2021-11-05 14:05:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7032 states have (on average 1.30773606370876) internal successors, (9196), 7044 states have internal predecessors, (9196), 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-05 14:05:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9196 transitions. [2021-11-05 14:05:29,417 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9196 transitions. Word has length 79 [2021-11-05 14:05:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:05:29,417 INFO L470 AbstractCegarLoop]: Abstraction has 7045 states and 9196 transitions. [2021-11-05 14:05:29,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:05:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9196 transitions. [2021-11-05 14:05:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:05:29,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:05:29,419 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-05 14:05:29,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-05 14:05:29,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:05:29,627 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:05:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:05:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -648257224, now seen corresponding path program 1 times [2021-11-05 14:05:29,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:05:29,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353298330] [2021-11-05 14:05:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:05:29,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:05:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:05:29,630 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:05:29,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-05 14:05:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:05:30,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 14:05:30,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:05:30,533 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-05 14:05:30,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:05:30,920 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-05 14:05:30,920 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:05:30,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353298330] [2021-11-05 14:05:30,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353298330] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:05:30,921 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:05:30,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-05 14:05:30,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740860281] [2021-11-05 14:05:30,921 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:05:30,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-05 14:05:30,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:05:30,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-05 14:05:30,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-05 14:05:30,922 INFO L87 Difference]: Start difference. First operand 7045 states and 9196 transitions. Second operand has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 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-05 14:05:33,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:35,011 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:05:38,968 INFO L93 Difference]: Finished difference Result 36777 states and 48158 transitions. [2021-11-05 14:05:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-05 14:05:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 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-05 14:05:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:05:39,040 INFO L225 Difference]: With dead ends: 36777 [2021-11-05 14:05:39,041 INFO L226 Difference]: Without dead ends: 33220 [2021-11-05 14:05:39,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 400.21ms TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2021-11-05 14:05:39,057 INFO L933 BasicCegarLoop]: 3916 mSDtfsCounter, 29200 mSDsluCounter, 18026 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 604 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5377.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29200 SdHoareTripleChecker+Valid, 21942 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.03ms SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5569.60ms IncrementalHoareTripleChecker+Time [2021-11-05 14:05:39,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29200 Valid, 21942 Invalid, 1403 Unknown, 0 Unchecked, 25.03ms Time], IncrementalHoareTripleChecker [604 Valid, 797 Invalid, 2 Unknown, 0 Unchecked, 5569.60ms Time] [2021-11-05 14:05:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33220 states. [2021-11-05 14:05:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33220 to 17401. [2021-11-05 14:05:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17401 states, 17388 states have (on average 1.3103289625028756) internal successors, (22784), 17400 states have internal predecessors, (22784), 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-05 14:05:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17401 states to 17401 states and 22784 transitions. [2021-11-05 14:05:40,556 INFO L78 Accepts]: Start accepts. Automaton has 17401 states and 22784 transitions. Word has length 79 [2021-11-05 14:05:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:05:40,557 INFO L470 AbstractCegarLoop]: Abstraction has 17401 states and 22784 transitions. [2021-11-05 14:05:40,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 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-05 14:05:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17401 states and 22784 transitions. [2021-11-05 14:05:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 14:05:40,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:05:40,559 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-05 14:05:40,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-05 14:05:40,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:05:40,775 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:05:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:05:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-05 14:05:40,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:05:40,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24658222] [2021-11-05 14:05:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:05:40,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:05:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:05:40,778 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:05:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-05 14:05:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:05:42,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-05 14:05:42,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:05:42,599 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 13 treesize of output 9 [2021-11-05 14:05:42,612 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 13 treesize of output 9 [2021-11-05 14:05:42,764 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 14:05:42,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 14:05:42,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:05:42,778 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 23 treesize of output 22 [2021-11-05 14:05:42,886 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 14:05:42,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 14:05:42,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:05:42,903 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 23 treesize of output 22 [2021-11-05 14:05:42,994 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 47 treesize of output 43 [2021-11-05 14:05:42,999 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 43 treesize of output 39 [2021-11-05 14:05:43,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2021-11-05 14:05:43,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-05 14:05:43,112 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-05 14:05:43,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:05:43,568 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-05 14:05:43,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:05:43,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24658222] [2021-11-05 14:05:43,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24658222] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:05:43,569 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:05:43,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:05:43,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512454738] [2021-11-05 14:05:43,569 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:05:43,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:05:43,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:05:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:05:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:05:43,570 INFO L87 Difference]: Start difference. First operand 17401 states and 22784 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:05:45,663 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:48,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:50,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:52,549 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:54,048 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:57,123 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:05:59,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:01,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:02,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:04,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:06,482 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:09,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:12,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:14,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:16,641 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:18,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:20,105 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:21,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:25,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:26,965 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:06:30,167 INFO L93 Difference]: Finished difference Result 43355 states and 56710 transitions. [2021-11-05 14:06:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:06:30,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:06:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:06:30,212 INFO L225 Difference]: With dead ends: 43355 [2021-11-05 14:06:30,213 INFO L226 Difference]: Without dead ends: 25443 [2021-11-05 14:06:30,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 182.49ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:06:30,243 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 802 mSDsluCounter, 3037 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43357.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.67ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44496.05ms IncrementalHoareTripleChecker+Time [2021-11-05 14:06:30,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 4303 Invalid, 356 Unknown, 0 Unchecked, 6.67ms Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 44496.05ms Time] [2021-11-05 14:06:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25443 states. [2021-11-05 14:06:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25443 to 11503. [2021-11-05 14:06:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11503 states, 11490 states have (on average 1.306875543951262) internal successors, (15016), 11502 states have internal predecessors, (15016), 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-05 14:06:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11503 states to 11503 states and 15016 transitions. [2021-11-05 14:06:31,303 INFO L78 Accepts]: Start accepts. Automaton has 11503 states and 15016 transitions. Word has length 79 [2021-11-05 14:06:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:06:31,303 INFO L470 AbstractCegarLoop]: Abstraction has 11503 states and 15016 transitions. [2021-11-05 14:06:31,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-05 14:06:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 11503 states and 15016 transitions. [2021-11-05 14:06:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-05 14:06:31,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:06:31,305 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] [2021-11-05 14:06:31,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-05 14:06:31,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:06:31,520 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:06:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:06:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-05 14:06:31,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:06:31,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521420769] [2021-11-05 14:06:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:06:31,521 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:06:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:06:31,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:06:31,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-05 14:06:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:06:32,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:06:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:06:32,359 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 37 treesize of output 25 [2021-11-05 14:06:32,364 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 22 treesize of output 10 [2021-11-05 14:06:32,417 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-05 14:06:32,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:06:32,715 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-05 14:06:32,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:06:32,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521420769] [2021-11-05 14:06:32,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521420769] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:06:32,716 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:06:32,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:06:32,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203753891] [2021-11-05 14:06:32,716 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:06:32,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:06:32,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:06:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:06:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:06:32,718 INFO L87 Difference]: Start difference. First operand 11503 states and 15016 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:06:34,803 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:36,812 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:41,159 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:43,174 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:45,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:46,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:49,332 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:51,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:53,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:54,932 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:57,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:06:59,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:00,793 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:02,105 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:06,122 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:08,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:09,896 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:11,922 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:13,168 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:15,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:17,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:20,560 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:32,056 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:33,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:35,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:37,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:39,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:41,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:42,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:44,403 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:48,541 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:49,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:53,371 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:55,390 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:57,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:07:58,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:00,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:02,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:03,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:05,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:08,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:08:14,441 INFO L93 Difference]: Finished difference Result 22633 states and 29572 transitions. [2021-11-05 14:08:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:08:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-05 14:08:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:08:14,472 INFO L225 Difference]: With dead ends: 22633 [2021-11-05 14:08:14,472 INFO L226 Difference]: Without dead ends: 22486 [2021-11-05 14:08:14,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 240.40ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:08:14,478 INFO L933 BasicCegarLoop]: 1547 mSDtfsCounter, 736 mSDsluCounter, 3843 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 18 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97339.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.66ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99948.23ms IncrementalHoareTripleChecker+Time [2021-11-05 14:08:14,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 5390 Invalid, 960 Unknown, 0 Unchecked, 12.66ms Time], IncrementalHoareTripleChecker [18 Valid, 926 Invalid, 16 Unknown, 0 Unchecked, 99948.23ms Time] [2021-11-05 14:08:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22486 states. [2021-11-05 14:08:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22486 to 11508. [2021-11-05 14:08:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11508 states, 11495 states have (on average 1.3059591126576773) internal successors, (15012), 11507 states have internal predecessors, (15012), 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-05 14:08:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11508 states to 11508 states and 15012 transitions. [2021-11-05 14:08:15,542 INFO L78 Accepts]: Start accepts. Automaton has 11508 states and 15012 transitions. Word has length 85 [2021-11-05 14:08:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:08:15,542 INFO L470 AbstractCegarLoop]: Abstraction has 11508 states and 15012 transitions. [2021-11-05 14:08:15,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:08:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11508 states and 15012 transitions. [2021-11-05 14:08:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 14:08:15,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:08:15,545 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] [2021-11-05 14:08:15,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-05 14:08:15,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:08:15,760 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:08:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:08:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-05 14:08:15,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:08:15,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078644439] [2021-11-05 14:08:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:08:15,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:08:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:08:15,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:08:15,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-05 14:08:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:08:17,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:08:17,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:08:17,641 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 13 treesize of output 9 [2021-11-05 14:08:17,653 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 13 treesize of output 9 [2021-11-05 14:08:17,802 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 14:08:17,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 14:08:17,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:08:17,818 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 23 treesize of output 22 [2021-11-05 14:08:17,970 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 14:08:17,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 14:08:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:08:17,993 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 23 treesize of output 22 [2021-11-05 14:08:18,012 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 37 treesize of output 25 [2021-11-05 14:08:18,018 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 22 treesize of output 10 [2021-11-05 14:08:18,106 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-05 14:08:18,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:08:18,456 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-05 14:08:18,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:08:18,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078644439] [2021-11-05 14:08:18,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078644439] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:08:18,457 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:08:18,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:08:18,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116131338] [2021-11-05 14:08:18,457 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:08:18,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:08:18,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:08:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:08:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:08:18,459 INFO L87 Difference]: Start difference. First operand 11508 states and 15012 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:08:20,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:24,070 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:27,363 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:29,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:31,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:33,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:36,358 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:37,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:39,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:42,042 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:44,271 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:51,057 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:53,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:56,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:08:59,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:00,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:03,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:05,379 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:07,115 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:09,272 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:09:11,633 INFO L93 Difference]: Finished difference Result 31957 states and 41687 transitions. [2021-11-05 14:09:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:09:11,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2021-11-05 14:09:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:09:11,661 INFO L225 Difference]: With dead ends: 31957 [2021-11-05 14:09:11,661 INFO L226 Difference]: Without dead ends: 20223 [2021-11-05 14:09:11,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 219.20ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:09:11,678 INFO L933 BasicCegarLoop]: 1250 mSDtfsCounter, 809 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50046.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.05ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51478.84ms IncrementalHoareTripleChecker+Time [2021-11-05 14:09:11,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [809 Valid, 4253 Invalid, 358 Unknown, 0 Unchecked, 8.05ms Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 10 Unknown, 0 Unchecked, 51478.84ms Time] [2021-11-05 14:09:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20223 states. [2021-11-05 14:09:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20223 to 10694. [2021-11-05 14:09:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10694 states, 10681 states have (on average 1.3048403707518024) internal successors, (13937), 10693 states have internal predecessors, (13937), 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-05 14:09:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10694 states to 10694 states and 13937 transitions. [2021-11-05 14:09:12,607 INFO L78 Accepts]: Start accepts. Automaton has 10694 states and 13937 transitions. Word has length 86 [2021-11-05 14:09:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:09:12,607 INFO L470 AbstractCegarLoop]: Abstraction has 10694 states and 13937 transitions. [2021-11-05 14:09:12,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-05 14:09:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 10694 states and 13937 transitions. [2021-11-05 14:09:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-05 14:09:12,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:09:12,609 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, 1, 1, 1, 1] [2021-11-05 14:09:12,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-05 14:09:12,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:09:12,810 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:09:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:09:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-05 14:09:12,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:09:12,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724833265] [2021-11-05 14:09:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:09:12,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:09:12,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:09:12,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:09:12,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-05 14:09:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:09:13,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:09:13,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:09:13,830 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 37 treesize of output 25 [2021-11-05 14:09:13,836 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 22 treesize of output 10 [2021-11-05 14:09:13,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-05 14:09:13,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:09:14,203 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-05 14:09:14,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:09:14,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724833265] [2021-11-05 14:09:14,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724833265] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:09:14,203 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:09:14,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:09:14,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67298749] [2021-11-05 14:09:14,204 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:09:14,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:09:14,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:09:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:09:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:09:14,205 INFO L87 Difference]: Start difference. First operand 10694 states and 13937 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05 14:09:16,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:18,301 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:20,310 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:22,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:24,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:26,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:31,045 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:33,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:35,554 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:37,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:39,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:41,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:43,453 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:45,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:47,513 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:49,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:51,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:55,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:57,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:09:59,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:01,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:03,324 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:08,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:10,805 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:12,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:14,894 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:16,390 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:18,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:19,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:21,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:23,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:25,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:27,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:28,521 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:34,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:38,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:43,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:45,897 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:47,632 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:51,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:53,723 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:55,743 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:10:58,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:00,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:01,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:04,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:05,935 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:07,960 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:10,557 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:12,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:15,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:17,197 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:18,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:19,958 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:21,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:23,339 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:28,328 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:30,349 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:32,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:34,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:36,451 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:38,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:39,660 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:41,679 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:43,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:44,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:46,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:47,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:51,447 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:11:52,749 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:12:02,071 INFO L93 Difference]: Finished difference Result 21026 states and 27429 transitions. [2021-11-05 14:12:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:12:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 92 [2021-11-05 14:12:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:12:02,101 INFO L225 Difference]: With dead ends: 21026 [2021-11-05 14:12:02,101 INFO L226 Difference]: Without dead ends: 20903 [2021-11-05 14:12:02,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 257.45ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:12:02,108 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 748 mSDsluCounter, 4967 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 20 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 162259.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 6515 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.59ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 166113.06ms IncrementalHoareTripleChecker+Time [2021-11-05 14:12:02,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 6515 Invalid, 1383 Unknown, 0 Unchecked, 16.59ms Time], IncrementalHoareTripleChecker [20 Valid, 1323 Invalid, 40 Unknown, 0 Unchecked, 166113.06ms Time] [2021-11-05 14:12:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20903 states. [2021-11-05 14:12:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20903 to 10710. [2021-11-05 14:12:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10710 states, 10697 states have (on average 1.3042909226886044) internal successors, (13952), 10709 states have internal predecessors, (13952), 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-05 14:12:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10710 states to 10710 states and 13952 transitions. [2021-11-05 14:12:03,075 INFO L78 Accepts]: Start accepts. Automaton has 10710 states and 13952 transitions. Word has length 92 [2021-11-05 14:12:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:12:03,076 INFO L470 AbstractCegarLoop]: Abstraction has 10710 states and 13952 transitions. [2021-11-05 14:12:03,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05 14:12:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 10710 states and 13952 transitions. [2021-11-05 14:12:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-05 14:12:03,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:12:03,078 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, 1, 1, 1, 1, 1] [2021-11-05 14:12:03,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-05 14:12:03,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:12:03,288 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:12:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:12:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-05 14:12:03,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:12:03,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315332188] [2021-11-05 14:12:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:12:03,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:12:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:12:03,290 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:12:03,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-05 14:12:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:12:05,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 14:12:05,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:12:05,354 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 13 treesize of output 9 [2021-11-05 14:12:05,369 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 13 treesize of output 9 [2021-11-05 14:12:05,497 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 14:12:05,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 14:12:05,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:12:05,512 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 23 treesize of output 22 [2021-11-05 14:12:05,538 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 37 treesize of output 25 [2021-11-05 14:12:05,542 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 22 treesize of output 10 [2021-11-05 14:12:05,611 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-05 14:12:05,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:12:05,900 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-05 14:12:05,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:12:05,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315332188] [2021-11-05 14:12:05,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315332188] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:12:05,901 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:12:05,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:12:05,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325831610] [2021-11-05 14:12:05,901 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:12:05,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:12:05,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:12:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:12:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:12:05,902 INFO L87 Difference]: Start difference. First operand 10710 states and 13952 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:12:08,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:10,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:13,114 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:15,434 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:17,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:19,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:21,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:23,097 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:26,116 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:28,153 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:30,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:32,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:40,779 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:42,540 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:12:46,698 INFO L93 Difference]: Finished difference Result 29465 states and 38416 transitions. [2021-11-05 14:12:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:12:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-05 14:12:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:12:46,729 INFO L225 Difference]: With dead ends: 29465 [2021-11-05 14:12:46,730 INFO L226 Difference]: Without dead ends: 18715 [2021-11-05 14:12:46,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 165.05ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:12:46,745 INFO L933 BasicCegarLoop]: 1249 mSDtfsCounter, 832 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37974.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.67ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39153.47ms IncrementalHoareTripleChecker+Time [2021-11-05 14:12:46,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [832 Valid, 4252 Invalid, 353 Unknown, 0 Unchecked, 7.67ms Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 9 Unknown, 0 Unchecked, 39153.47ms Time] [2021-11-05 14:12:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2021-11-05 14:12:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 9889. [2021-11-05 14:12:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9889 states, 9876 states have (on average 1.303665451599838) internal successors, (12875), 9888 states have internal predecessors, (12875), 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-05 14:12:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9889 states to 9889 states and 12875 transitions. [2021-11-05 14:12:47,646 INFO L78 Accepts]: Start accepts. Automaton has 9889 states and 12875 transitions. Word has length 93 [2021-11-05 14:12:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:12:47,647 INFO L470 AbstractCegarLoop]: Abstraction has 9889 states and 12875 transitions. [2021-11-05 14:12:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:12:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9889 states and 12875 transitions. [2021-11-05 14:12:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-05 14:12:47,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:12:47,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:12:47,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-05 14:12:47,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:12:47,857 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:12:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:12:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-05 14:12:47,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:12:47,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099027083] [2021-11-05 14:12:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:12:47,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:12:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:12:47,860 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:12:47,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-05 14:12:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:12:48,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:12:48,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:12:48,848 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 40 treesize of output 28 [2021-11-05 14:12:48,853 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 25 treesize of output 13 [2021-11-05 14:12:48,968 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-05 14:12:48,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:12:49,262 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-05 14:12:49,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:12:49,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099027083] [2021-11-05 14:12:49,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099027083] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:12:49,263 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:12:49,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-05 14:12:49,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841943238] [2021-11-05 14:12:49,263 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:12:49,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:12:49,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:12:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:12:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:12:49,265 INFO L87 Difference]: Start difference. First operand 9889 states and 12875 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-05 14:12:51,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:53,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:56,556 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:57,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:12:59,921 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:01,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:03,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:05,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:07,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:08,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:09,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:11,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:13,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:15,275 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:22,285 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:24,846 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:27,366 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:28,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:32,341 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:34,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:36,425 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:37,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:13:44,526 INFO L93 Difference]: Finished difference Result 25687 states and 33509 transitions. [2021-11-05 14:13:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:13:44,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 98 [2021-11-05 14:13:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:13:44,556 INFO L225 Difference]: With dead ends: 25687 [2021-11-05 14:13:44,556 INFO L226 Difference]: Without dead ends: 15759 [2021-11-05 14:13:44,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 240.20ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:13:44,569 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 883 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 34 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52074.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.16ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53685.42ms IncrementalHoareTripleChecker+Time [2021-11-05 14:13:44,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 3362 Invalid, 518 Unknown, 0 Unchecked, 9.16ms Time], IncrementalHoareTripleChecker [34 Valid, 474 Invalid, 10 Unknown, 0 Unchecked, 53685.42ms Time] [2021-11-05 14:13:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2021-11-05 14:13:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 8131. [2021-11-05 14:13:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8131 states, 8118 states have (on average 1.3026607538802661) internal successors, (10575), 8130 states have internal predecessors, (10575), 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-05 14:13:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8131 states to 8131 states and 10575 transitions. [2021-11-05 14:13:45,383 INFO L78 Accepts]: Start accepts. Automaton has 8131 states and 10575 transitions. Word has length 98 [2021-11-05 14:13:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:13:45,384 INFO L470 AbstractCegarLoop]: Abstraction has 8131 states and 10575 transitions. [2021-11-05 14:13:45,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-05 14:13:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 8131 states and 10575 transitions. [2021-11-05 14:13:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-05 14:13:45,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:13:45,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:13:45,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-05 14:13:45,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:13:45,597 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:13:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:13:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-05 14:13:45,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:13:45,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237720551] [2021-11-05 14:13:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:13:45,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:13:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:13:45,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:13:45,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-05 14:13:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:13:46,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 14:13:46,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:13:46,477 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 13 treesize of output 9 [2021-11-05 14:13:46,493 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 13 treesize of output 9 [2021-11-05 14:13:46,863 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 37 treesize of output 25 [2021-11-05 14:13:46,869 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 22 treesize of output 10 [2021-11-05 14:13:46,929 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-05 14:13:46,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:13:47,386 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-05 14:13:47,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:13:47,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237720551] [2021-11-05 14:13:47,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237720551] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:13:47,386 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:13:47,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:13:47,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887778325] [2021-11-05 14:13:47,387 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:13:47,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:13:47,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:13:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:13:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:13:47,388 INFO L87 Difference]: Start difference. First operand 8131 states and 10575 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-05 14:13:49,484 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:53,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:55,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:13:58,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:00,131 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:02,451 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:03,899 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:07,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:08,569 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:10,620 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:15,049 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:17,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:19,015 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:22,881 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:26,180 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:29,289 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:30,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:33,643 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:35,267 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:14:37,411 INFO L93 Difference]: Finished difference Result 12341 states and 16077 transitions. [2021-11-05 14:14:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:14:37,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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 99 [2021-11-05 14:14:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:14:37,431 INFO L225 Difference]: With dead ends: 12341 [2021-11-05 14:14:37,431 INFO L226 Difference]: Without dead ends: 12301 [2021-11-05 14:14:37,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 340.63ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:14:37,436 INFO L933 BasicCegarLoop]: 1219 mSDtfsCounter, 1588 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47253.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 4130 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.78ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48793.35ms IncrementalHoareTripleChecker+Time [2021-11-05 14:14:37,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1588 Valid, 4130 Invalid, 396 Unknown, 0 Unchecked, 9.78ms Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 9 Unknown, 0 Unchecked, 48793.35ms Time] [2021-11-05 14:14:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2021-11-05 14:14:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 8150. [2021-11-05 14:14:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8150 states, 8137 states have (on average 1.3031829912744255) internal successors, (10604), 8149 states have internal predecessors, (10604), 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-05 14:14:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 10604 transitions. [2021-11-05 14:14:38,208 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 10604 transitions. Word has length 99 [2021-11-05 14:14:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:14:38,208 INFO L470 AbstractCegarLoop]: Abstraction has 8150 states and 10604 transitions. [2021-11-05 14:14:38,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-05 14:14:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 10604 transitions. [2021-11-05 14:14:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-05 14:14:38,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:14:38,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:14:38,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-05 14:14:38,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:14:38,432 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:14:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:14:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-05 14:14:38,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:14:38,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315831535] [2021-11-05 14:14:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:14:38,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:14:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:14:38,434 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:14:38,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-05 14:14:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:14:39,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 14:14:39,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:14:39,542 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 13 treesize of output 9 [2021-11-05 14:14:39,556 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 13 treesize of output 9 [2021-11-05 14:14:39,631 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 37 treesize of output 25 [2021-11-05 14:14:39,638 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 22 treesize of output 10 [2021-11-05 14:14:39,827 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-05 14:14:39,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:14:40,105 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-05 14:14:40,105 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:14:40,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315831535] [2021-11-05 14:14:40,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315831535] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:14:40,105 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:14:40,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 14:14:40,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184302911] [2021-11-05 14:14:40,106 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:14:40,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:14:40,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:14:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:14:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:14:40,107 INFO L87 Difference]: Start difference. First operand 8150 states and 10604 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-05 14:14:42,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:44,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:47,348 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:49,195 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:51,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:53,628 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:55,851 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:57,055 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:14:59,827 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:15:01,884 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:15:03,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:15:05,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:15:07,253 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:15:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:15:10,336 INFO L93 Difference]: Finished difference Result 11471 states and 14886 transitions. [2021-11-05 14:15:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:15:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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 126 [2021-11-05 14:15:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:15:10,344 INFO L225 Difference]: With dead ends: 11471 [2021-11-05 14:15:10,344 INFO L226 Difference]: Without dead ends: 4803 [2021-11-05 14:15:10,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 166.61ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:15:10,351 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 53 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28759.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3070 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.68ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29642.70ms IncrementalHoareTripleChecker+Time [2021-11-05 14:15:10,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 3070 Invalid, 257 Unknown, 0 Unchecked, 4.68ms Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 29642.70ms Time] [2021-11-05 14:15:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2021-11-05 14:15:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4756. [2021-11-05 14:15:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4743 states have (on average 1.298123550495467) internal successors, (6157), 4755 states have internal predecessors, (6157), 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-05 14:15:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 6157 transitions. [2021-11-05 14:15:10,798 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 6157 transitions. Word has length 126 [2021-11-05 14:15:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:15:10,798 INFO L470 AbstractCegarLoop]: Abstraction has 4756 states and 6157 transitions. [2021-11-05 14:15:10,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-05 14:15:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 6157 transitions. [2021-11-05 14:15:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-05 14:15:10,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:15:10,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:15:10,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-05 14:15:11,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:15:11,012 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:15:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:15:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1858974813, now seen corresponding path program 1 times [2021-11-05 14:15:11,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:15:11,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351186097] [2021-11-05 14:15:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:15:11,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:15:11,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:15:11,014 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:15:11,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-05 14:15:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:15:12,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:15:12,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:15:12,249 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-05 14:15:12,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:15:12,456 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-05 14:15:12,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:15:12,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351186097] [2021-11-05 14:15:12,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351186097] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:15:12,457 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:15:12,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 14:15:12,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381951951] [2021-11-05 14:15:12,457 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:15:12,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:15:12,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:15:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:15:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:15:12,458 INFO L87 Difference]: Start difference. First operand 4756 states and 6157 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 14:15:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:15:13,250 INFO L93 Difference]: Finished difference Result 9941 states and 12868 transitions. [2021-11-05 14:15:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:15:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2021-11-05 14:15:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:15:13,260 INFO L225 Difference]: With dead ends: 9941 [2021-11-05 14:15:13,260 INFO L226 Difference]: Without dead ends: 5194 [2021-11-05 14:15:13,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.71ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:15:13,267 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 761 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 248.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 309.97ms IncrementalHoareTripleChecker+Time [2021-11-05 14:15:13,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 1745 Invalid, 75 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [33 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 309.97ms Time] [2021-11-05 14:15:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2021-11-05 14:15:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 4696. [2021-11-05 14:15:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4683 states have (on average 1.28913089899637) internal successors, (6037), 4695 states have internal predecessors, (6037), 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-05 14:15:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6037 transitions. [2021-11-05 14:15:13,731 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6037 transitions. Word has length 126 [2021-11-05 14:15:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:15:13,731 INFO L470 AbstractCegarLoop]: Abstraction has 4696 states and 6037 transitions. [2021-11-05 14:15:13,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 14:15:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6037 transitions. [2021-11-05 14:15:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-05 14:15:13,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:15:13,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:15:13,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-05 14:15:13,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:15:13,940 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:15:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:15:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -758969181, now seen corresponding path program 1 times [2021-11-05 14:15:13,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:15:13,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958420802] [2021-11-05 14:15:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:15:13,941 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:15:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:15:13,942 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:15:13,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-05 14:15:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:15:15,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:15:15,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:15:15,258 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-05 14:15:15,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:15:15,390 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-05 14:15:15,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:15:15,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958420802] [2021-11-05 14:15:15,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958420802] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:15:15,390 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:15:15,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 14:15:15,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307687593] [2021-11-05 14:15:15,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:15:15,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:15:15,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:15:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:15:15,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:15:15,392 INFO L87 Difference]: Start difference. First operand 4696 states and 6037 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 14:15:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:15:16,022 INFO L93 Difference]: Finished difference Result 4982 states and 6413 transitions. [2021-11-05 14:15:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:15:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2021-11-05 14:15:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:15:16,028 INFO L225 Difference]: With dead ends: 4982 [2021-11-05 14:15:16,028 INFO L226 Difference]: Without dead ends: 4978 [2021-11-05 14:15:16,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.83ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:15:16,029 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 1218 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.14ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 166.14ms IncrementalHoareTripleChecker+Time [2021-11-05 14:15:16,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 1909 Invalid, 13 Unknown, 0 Unchecked, 2.14ms Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 166.14ms Time] [2021-11-05 14:15:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2021-11-05 14:15:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4696. [2021-11-05 14:15:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4683 states have (on average 1.2882767456758488) internal successors, (6033), 4695 states have internal predecessors, (6033), 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-05 14:15:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6033 transitions. [2021-11-05 14:15:16,453 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6033 transitions. Word has length 126 [2021-11-05 14:15:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:15:16,453 INFO L470 AbstractCegarLoop]: Abstraction has 4696 states and 6033 transitions. [2021-11-05 14:15:16,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 14:15:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6033 transitions. [2021-11-05 14:15:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-05 14:15:16,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:15:16,455 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-05 14:15:16,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-05 14:15:16,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:15:16,659 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:15:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:15:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1856285262, now seen corresponding path program 1 times [2021-11-05 14:15:16,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:15:16,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299117075] [2021-11-05 14:15:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:15:16,661 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:15:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:15:16,662 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:15:16,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-05 14:15:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:15:17,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:15:17,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:15:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:15:18,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:15:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:15:18,971 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:15:18,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299117075] [2021-11-05 14:15:18,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299117075] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 14:15:18,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-05 14:15:18,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-05 14:15:18,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313365182] [2021-11-05 14:15:18,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-05 14:15:18,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:15:18,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:15:18,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:15:18,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:15:18,973 INFO L87 Difference]: Start difference. First operand 4696 states and 6033 transitions. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-05 14:15:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:15:19,427 INFO L93 Difference]: Finished difference Result 7432 states and 9493 transitions. [2021-11-05 14:15:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:15:19,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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 131 [2021-11-05 14:15:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:15:19,433 INFO L225 Difference]: With dead ends: 7432 [2021-11-05 14:15:19,433 INFO L226 Difference]: Without dead ends: 3863 [2021-11-05 14:15:19,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.43ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:15:19,437 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1045 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.47ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.49ms IncrementalHoareTripleChecker+Time [2021-11-05 14:15:19,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 3089 Invalid, 29 Unknown, 0 Unchecked, 2.47ms Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 72.49ms Time] [2021-11-05 14:15:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2021-11-05 14:15:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3859. [2021-11-05 14:15:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3846 states have (on average 1.2722308892355694) internal successors, (4893), 3858 states have internal predecessors, (4893), 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-05 14:15:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 4893 transitions. [2021-11-05 14:15:19,828 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 4893 transitions. Word has length 131 [2021-11-05 14:15:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:15:19,828 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 4893 transitions. [2021-11-05 14:15:19,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-05 14:15:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4893 transitions. [2021-11-05 14:15:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-05 14:15:19,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:15:19,830 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:15:19,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-05 14:15:20,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:15:20,044 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-05 14:15:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:15:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-05 14:15:20,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:15:20,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289019349] [2021-11-05 14:15:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:15:20,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:15:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:15:20,046 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:15:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-05 14:15:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-05 14:15:41,439 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. Killed by 15