./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.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 14116a47f3f4a2a033e7a89d50301476fe518641457365dd95d98c606e6851b5 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 20:43:52,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 20:43:52,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 20:43:52,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 20:43:52,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 20:43:52,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 20:43:52,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 20:43:52,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 20:43:52,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 20:43:52,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 20:43:52,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 20:43:52,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 20:43:52,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 20:43:52,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 20:43:52,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 20:43:52,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 20:43:52,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 20:43:52,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 20:43:52,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 20:43:52,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 20:43:52,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 20:43:52,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 20:43:52,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 20:43:52,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 20:43:52,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 20:43:52,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 20:43:52,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 20:43:52,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 20:43:52,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 20:43:52,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 20:43:52,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 20:43:52,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 20:43:52,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 20:43:52,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 20:43:52,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 20:43:52,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 20:43:52,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 20:43:52,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 20:43:52,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 20:43:52,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 20:43:52,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 20:43:52,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 20:43:52,746 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 20:43:52,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 20:43:52,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 20:43:52,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 20:43:52,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 20:43:52,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 20:43:52,749 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 20:43:52,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 20:43:52,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 20:43:52,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 20:43:52,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 20:43:52,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 20:43:52,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 20:43:52,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 20:43:52,751 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 20:43:52,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 20:43:52,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 20:43:52,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 20:43:52,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 20:43:52,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 20:43:52,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 20:43:52,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 20:43:52,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 20:43:52,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 20:43:52,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 20:43:52,754 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 20:43:52,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 20:43:52,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 20:43:52,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 20:43:52,754 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 -> 14116a47f3f4a2a033e7a89d50301476fe518641457365dd95d98c606e6851b5 [2021-11-06 20:43:52,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 20:43:52,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 20:43:52,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 20:43:52,944 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 20:43:52,944 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 20:43:52,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i [2021-11-06 20:43:52,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616e82f57/b99228f4baf843f3a6868f6ae2e43dd1/FLAG55f898146 [2021-11-06 20:43:53,710 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 20:43:53,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i [2021-11-06 20:43:53,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616e82f57/b99228f4baf843f3a6868f6ae2e43dd1/FLAG55f898146 [2021-11-06 20:43:54,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616e82f57/b99228f4baf843f3a6868f6ae2e43dd1 [2021-11-06 20:43:54,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 20:43:54,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 20:43:54,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 20:43:54,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 20:43:54,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 20:43:54,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:43:54" (1/1) ... [2021-11-06 20:43:54,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d692b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:54, skipping insertion in model container [2021-11-06 20:43:54,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:43:54" (1/1) ... [2021-11-06 20:43:54,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 20:43:54,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 20:43:58,197 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[485804,485817] [2021-11-06 20:43:58,199 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[485973,485986] [2021-11-06 20:43:58,200 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[486140,486153] [2021-11-06 20:43:58,200 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[486308,486321] [2021-11-06 20:43:58,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 20:43:58,265 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 20:43:58,601 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[485804,485817] [2021-11-06 20:43:58,602 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[485973,485986] [2021-11-06 20:43:58,602 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[486140,486153] [2021-11-06 20:43:58,602 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-challenges/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i[486308,486321] [2021-11-06 20:43:58,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 20:43:58,842 INFO L208 MainTranslator]: Completed translation [2021-11-06 20:43:58,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58 WrapperNode [2021-11-06 20:43:58,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 20:43:58,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 20:43:58,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 20:43:58,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 20:43:58,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:43:58,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:00,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 20:44:00,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 20:44:00,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 20:44:00,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 20:44:00,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:00,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:00,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:00,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:01,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:01,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:01,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:02,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 20:44:02,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 20:44:02,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 20:44:02,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 20:44:02,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (1/1) ... [2021-11-06 20:44:02,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 20:44:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 20:44:02,277 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-06 20:44:02,319 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-06 20:44:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_reset_hw_vf [2021-11-06 20:44:02,355 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_reset_hw_vf [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 20:44:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 20:44:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_write_posted_mbx [2021-11-06 20:44:02,356 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_write_posted_mbx [2021-11-06 20:44:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_hw_vf [2021-11-06 20:44:02,356 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_hw_vf [2021-11-06 20:44:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 20:44:02,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 20:44:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_ack [2021-11-06 20:44:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_ack [2021-11-06 20:44:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 20:44:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 20:44:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_rar_set_vf [2021-11-06 20:44:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_rar_set_vf [2021-11-06 20:44:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_link_vf [2021-11-06 20:44:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_link_vf [2021-11-06 20:44:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 20:44:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 20:44:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-06 20:44:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-06 20:44:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 20:44:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-06 20:44:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-06 20:44:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_msg [2021-11-06 20:44:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_msg [2021-11-06 20:44:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 20:44:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_posted_mbx [2021-11-06 20:44:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_posted_mbx [2021-11-06 20:44:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 20:44:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 20:44:23,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#2: ldv_switch_1_#res := 0; [2021-11-06 20:44:23,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#3: ldv_switch_1_#res := 0; [2021-11-06 20:44:23,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break: ldv_switch_1_#res := 0; [2021-11-06 20:44:23,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#2: ldv_switch_0_#res := 0; [2021-11-06 20:44:23,640 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 20:44:23,640 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break: ldv_switch_0_#res := 0; [2021-11-06 20:44:23,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 20:44:23,704 INFO L299 CfgBuilder]: Removed 9691 assume(true) statements. [2021-11-06 20:44:23,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:44:23 BoogieIcfgContainer [2021-11-06 20:44:23,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 20:44:23,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 20:44:23,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 20:44:23,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 20:44:23,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:43:54" (1/3) ... [2021-11-06 20:44:23,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17f60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:44:23, skipping insertion in model container [2021-11-06 20:44:23,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:43:58" (2/3) ... [2021-11-06 20:44:23,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17f60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:44:23, skipping insertion in model container [2021-11-06 20:44:23,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:44:23" (3/3) ... [2021-11-06 20:44:23,721 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-intel-igbvf-igbvf.cil.i [2021-11-06 20:44:23,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 20:44:23,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-06 20:44:23,788 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 20:44:23,803 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-06 20:44:23,804 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-06 20:44:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 9382 states, 9215 states have (on average 1.3274009766684753) internal successors, (12232), 9256 states have internal predecessors, (12232), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2021-11-06 20:44:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 20:44:23,940 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:23,941 INFO L513 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] [2021-11-06 20:44:23,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash -623206203, now seen corresponding path program 1 times [2021-11-06 20:44:23,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:23,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598818842] [2021-11-06 20:44:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:23,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:24,674 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-06 20:44:24,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:24,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598818842] [2021-11-06 20:44:24,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598818842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:24,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:24,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:24,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173210183] [2021-11-06 20:44:24,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 20:44:24,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 20:44:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:24,712 INFO L87 Difference]: Start difference. First operand has 9382 states, 9215 states have (on average 1.3274009766684753) internal successors, (12232), 9256 states have internal predecessors, (12232), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-06 20:44:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:26,317 INFO L93 Difference]: Finished difference Result 27424 states and 36462 transitions. [2021-11-06 20:44:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 20:44:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-11-06 20:44:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:26,396 INFO L225 Difference]: With dead ends: 27424 [2021-11-06 20:44:26,396 INFO L226 Difference]: Without dead ends: 17758 [2021-11-06 20:44:26,431 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17758 states. [2021-11-06 20:44:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17758 to 17758. [2021-11-06 20:44:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17758 states, 17466 states have (on average 1.2856979274018092) internal successors, (22456), 17507 states have internal predecessors, (22456), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 230 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 20:44:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 22916 transitions. [2021-11-06 20:44:27,034 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 22916 transitions. Word has length 90 [2021-11-06 20:44:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:27,036 INFO L470 AbstractCegarLoop]: Abstraction has 17758 states and 22916 transitions. [2021-11-06 20:44:27,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-06 20:44:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 22916 transitions. [2021-11-06 20:44:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 20:44:27,044 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:27,045 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:27,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 20:44:27,046 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash -968367872, now seen corresponding path program 1 times [2021-11-06 20:44:27,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:27,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499091128] [2021-11-06 20:44:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:27,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 20:44:27,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:27,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499091128] [2021-11-06 20:44:27,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499091128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:27,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:27,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:27,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546425521] [2021-11-06 20:44:27,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 20:44:27,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 20:44:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:27,325 INFO L87 Difference]: Start difference. First operand 17758 states and 22916 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:29,077 INFO L93 Difference]: Finished difference Result 35318 states and 45614 transitions. [2021-11-06 20:44:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 20:44:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-06 20:44:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:29,166 INFO L225 Difference]: With dead ends: 35318 [2021-11-06 20:44:29,167 INFO L226 Difference]: Without dead ends: 26428 [2021-11-06 20:44:29,190 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26428 states. [2021-11-06 20:44:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26428 to 26428. [2021-11-06 20:44:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26428 states, 26011 states have (on average 1.2863403944485026) internal successors, (33459), 26052 states have internal predecessors, (33459), 345 states have call successors, (345), 30 states have call predecessors, (345), 30 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) [2021-11-06 20:44:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26428 states to 26428 states and 34149 transitions. [2021-11-06 20:44:29,809 INFO L78 Accepts]: Start accepts. Automaton has 26428 states and 34149 transitions. Word has length 119 [2021-11-06 20:44:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:29,811 INFO L470 AbstractCegarLoop]: Abstraction has 26428 states and 34149 transitions. [2021-11-06 20:44:29,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 26428 states and 34149 transitions. [2021-11-06 20:44:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 20:44:29,821 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:29,822 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:29,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 20:44:29,822 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2046735746, now seen corresponding path program 1 times [2021-11-06 20:44:29,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:29,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134090954] [2021-11-06 20:44:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:29,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 20:44:30,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:30,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134090954] [2021-11-06 20:44:30,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134090954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:30,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:30,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:30,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939883277] [2021-11-06 20:44:30,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 20:44:30,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 20:44:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:30,055 INFO L87 Difference]: Start difference. First operand 26428 states and 34149 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:32,795 INFO L93 Difference]: Finished difference Result 52659 states and 68082 transitions. [2021-11-06 20:44:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 20:44:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-06 20:44:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:32,872 INFO L225 Difference]: With dead ends: 52659 [2021-11-06 20:44:32,872 INFO L226 Difference]: Without dead ends: 35099 [2021-11-06 20:44:32,913 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 20:44:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35099 states. [2021-11-06 20:44:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35099 to 35099. [2021-11-06 20:44:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35099 states, 34557 states have (on average 1.2866568278496398) internal successors, (44463), 34598 states have internal predecessors, (44463), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35099 states to 35099 states and 45383 transitions. [2021-11-06 20:44:33,554 INFO L78 Accepts]: Start accepts. Automaton has 35099 states and 45383 transitions. Word has length 119 [2021-11-06 20:44:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:33,555 INFO L470 AbstractCegarLoop]: Abstraction has 35099 states and 45383 transitions. [2021-11-06 20:44:33,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35099 states and 45383 transitions. [2021-11-06 20:44:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-06 20:44:33,560 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:33,560 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:33,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 20:44:33,560 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 764247360, now seen corresponding path program 1 times [2021-11-06 20:44:33,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:33,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752743071] [2021-11-06 20:44:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:33,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:33,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:33,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752743071] [2021-11-06 20:44:33,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752743071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:33,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:33,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:33,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093672273] [2021-11-06 20:44:33,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:33,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:33,809 INFO L87 Difference]: Start difference. First operand 35099 states and 45383 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-06 20:44:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:34,367 INFO L93 Difference]: Finished difference Result 35099 states and 45383 transitions. [2021-11-06 20:44:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 120 [2021-11-06 20:44:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:34,439 INFO L225 Difference]: With dead ends: 35099 [2021-11-06 20:44:34,440 INFO L226 Difference]: Without dead ends: 35093 [2021-11-06 20:44:34,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35093 states. [2021-11-06 20:44:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35093 to 35093. [2021-11-06 20:44:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35093 states, 34554 states have (on average 1.2865948949470394) internal successors, (44457), 34592 states have internal predecessors, (44457), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35093 states to 35093 states and 45377 transitions. [2021-11-06 20:44:35,305 INFO L78 Accepts]: Start accepts. Automaton has 35093 states and 45377 transitions. Word has length 120 [2021-11-06 20:44:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:35,305 INFO L470 AbstractCegarLoop]: Abstraction has 35093 states and 45377 transitions. [2021-11-06 20:44:35,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-06 20:44:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35093 states and 45377 transitions. [2021-11-06 20:44:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-06 20:44:35,311 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:35,311 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:35,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 20:44:35,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2485027, now seen corresponding path program 1 times [2021-11-06 20:44:35,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:35,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75212958] [2021-11-06 20:44:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:35,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:35,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:35,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75212958] [2021-11-06 20:44:35,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75212958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:35,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:35,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:35,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566238571] [2021-11-06 20:44:35,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:35,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:35,631 INFO L87 Difference]: Start difference. First operand 35093 states and 45377 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-06 20:44:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:36,377 INFO L93 Difference]: Finished difference Result 35093 states and 45377 transitions. [2021-11-06 20:44:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 122 [2021-11-06 20:44:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:36,451 INFO L225 Difference]: With dead ends: 35093 [2021-11-06 20:44:36,452 INFO L226 Difference]: Without dead ends: 35087 [2021-11-06 20:44:36,470 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35087 states. [2021-11-06 20:44:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35087 to 35087. [2021-11-06 20:44:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35087 states, 34551 states have (on average 1.2865329512893984) internal successors, (44451), 34586 states have internal predecessors, (44451), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35087 states to 35087 states and 45371 transitions. [2021-11-06 20:44:37,315 INFO L78 Accepts]: Start accepts. Automaton has 35087 states and 45371 transitions. Word has length 122 [2021-11-06 20:44:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:37,315 INFO L470 AbstractCegarLoop]: Abstraction has 35087 states and 45371 transitions. [2021-11-06 20:44:37,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-06 20:44:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35087 states and 45371 transitions. [2021-11-06 20:44:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 20:44:37,320 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:37,321 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:37,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 20:44:37,321 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1906676346, now seen corresponding path program 1 times [2021-11-06 20:44:37,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:37,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742674116] [2021-11-06 20:44:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:37,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:37,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:37,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742674116] [2021-11-06 20:44:37,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742674116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:37,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:37,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:37,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85752685] [2021-11-06 20:44:37,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:37,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:37,548 INFO L87 Difference]: Start difference. First operand 35087 states and 45371 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-06 20:44:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:38,173 INFO L93 Difference]: Finished difference Result 35087 states and 45371 transitions. [2021-11-06 20:44:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 124 [2021-11-06 20:44:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:38,268 INFO L225 Difference]: With dead ends: 35087 [2021-11-06 20:44:38,269 INFO L226 Difference]: Without dead ends: 35081 [2021-11-06 20:44:38,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35081 states. [2021-11-06 20:44:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35081 to 35081. [2021-11-06 20:44:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35081 states, 34548 states have (on average 1.2864709968739145) internal successors, (44445), 34580 states have internal predecessors, (44445), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35081 states to 35081 states and 45365 transitions. [2021-11-06 20:44:39,317 INFO L78 Accepts]: Start accepts. Automaton has 35081 states and 45365 transitions. Word has length 124 [2021-11-06 20:44:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:39,318 INFO L470 AbstractCegarLoop]: Abstraction has 35081 states and 45365 transitions. [2021-11-06 20:44:39,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-06 20:44:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 35081 states and 45365 transitions. [2021-11-06 20:44:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-06 20:44:39,325 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:39,325 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:39,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 20:44:39,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:39,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1635247209, now seen corresponding path program 1 times [2021-11-06 20:44:39,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:39,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010163113] [2021-11-06 20:44:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:39,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:39,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:39,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010163113] [2021-11-06 20:44:39,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010163113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:39,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:39,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:39,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502345931] [2021-11-06 20:44:39,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:39,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:39,529 INFO L87 Difference]: Start difference. First operand 35081 states and 45365 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-06 20:44:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:40,299 INFO L93 Difference]: Finished difference Result 35081 states and 45365 transitions. [2021-11-06 20:44:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-06 20:44:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:40,386 INFO L225 Difference]: With dead ends: 35081 [2021-11-06 20:44:40,387 INFO L226 Difference]: Without dead ends: 35075 [2021-11-06 20:44:40,399 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35075 states. [2021-11-06 20:44:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35075 to 35075. [2021-11-06 20:44:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35075 states, 34545 states have (on average 1.2864090316977854) internal successors, (44439), 34574 states have internal predecessors, (44439), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35075 states to 35075 states and 45359 transitions. [2021-11-06 20:44:41,301 INFO L78 Accepts]: Start accepts. Automaton has 35075 states and 45359 transitions. Word has length 126 [2021-11-06 20:44:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:41,302 INFO L470 AbstractCegarLoop]: Abstraction has 35075 states and 45359 transitions. [2021-11-06 20:44:41,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-06 20:44:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 35075 states and 45359 transitions. [2021-11-06 20:44:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-06 20:44:41,310 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:41,310 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:41,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 20:44:41,311 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:41,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash -485281844, now seen corresponding path program 1 times [2021-11-06 20:44:41,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:41,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046550165] [2021-11-06 20:44:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:41,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:41,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:41,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046550165] [2021-11-06 20:44:41,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046550165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:41,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:41,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:41,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976728974] [2021-11-06 20:44:41,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:41,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:41,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:41,556 INFO L87 Difference]: Start difference. First operand 35075 states and 45359 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:42,280 INFO L93 Difference]: Finished difference Result 35075 states and 45359 transitions. [2021-11-06 20:44:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 128 [2021-11-06 20:44:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:42,346 INFO L225 Difference]: With dead ends: 35075 [2021-11-06 20:44:42,347 INFO L226 Difference]: Without dead ends: 35069 [2021-11-06 20:44:42,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35069 states. [2021-11-06 20:44:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35069 to 35069. [2021-11-06 20:44:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35069 states, 34542 states have (on average 1.2863470557582073) internal successors, (44433), 34568 states have internal predecessors, (44433), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35069 states to 35069 states and 45353 transitions. [2021-11-06 20:44:43,277 INFO L78 Accepts]: Start accepts. Automaton has 35069 states and 45353 transitions. Word has length 128 [2021-11-06 20:44:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:43,278 INFO L470 AbstractCegarLoop]: Abstraction has 35069 states and 45353 transitions. [2021-11-06 20:44:43,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-06 20:44:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 35069 states and 45353 transitions. [2021-11-06 20:44:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-06 20:44:43,285 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:43,286 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:43,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 20:44:43,286 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1795764143, now seen corresponding path program 1 times [2021-11-06 20:44:43,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:43,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489043177] [2021-11-06 20:44:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:43,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:43,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:43,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489043177] [2021-11-06 20:44:43,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489043177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:43,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:43,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:43,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481308731] [2021-11-06 20:44:43,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:43,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:43,477 INFO L87 Difference]: Start difference. First operand 35069 states and 45353 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-06 20:44:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:44,426 INFO L93 Difference]: Finished difference Result 35069 states and 45353 transitions. [2021-11-06 20:44:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 130 [2021-11-06 20:44:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:44,494 INFO L225 Difference]: With dead ends: 35069 [2021-11-06 20:44:44,495 INFO L226 Difference]: Without dead ends: 35063 [2021-11-06 20:44:44,514 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35063 states. [2021-11-06 20:44:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35063 to 35063. [2021-11-06 20:44:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35063 states, 34539 states have (on average 1.2862850690523755) internal successors, (44427), 34562 states have internal predecessors, (44427), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35063 states to 35063 states and 45347 transitions. [2021-11-06 20:44:45,689 INFO L78 Accepts]: Start accepts. Automaton has 35063 states and 45347 transitions. Word has length 130 [2021-11-06 20:44:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:45,690 INFO L470 AbstractCegarLoop]: Abstraction has 35063 states and 45347 transitions. [2021-11-06 20:44:45,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-06 20:44:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 35063 states and 45347 transitions. [2021-11-06 20:44:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-06 20:44:45,696 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:45,698 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:45,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 20:44:45,699 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash -847330286, now seen corresponding path program 1 times [2021-11-06 20:44:45,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:45,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770357075] [2021-11-06 20:44:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:45,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:45,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:45,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770357075] [2021-11-06 20:44:45,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770357075] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:45,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:45,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:45,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904559373] [2021-11-06 20:44:45,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:45,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:45,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:45,879 INFO L87 Difference]: Start difference. First operand 35063 states and 45347 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-06 20:44:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:46,593 INFO L93 Difference]: Finished difference Result 35063 states and 45347 transitions. [2021-11-06 20:44:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:46,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 132 [2021-11-06 20:44:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:46,654 INFO L225 Difference]: With dead ends: 35063 [2021-11-06 20:44:46,654 INFO L226 Difference]: Without dead ends: 35057 [2021-11-06 20:44:46,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35057 states. [2021-11-06 20:44:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35057 to 35057. [2021-11-06 20:44:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35057 states, 34536 states have (on average 1.2862230715774843) internal successors, (44421), 34556 states have internal predecessors, (44421), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35057 states to 35057 states and 45341 transitions. [2021-11-06 20:44:47,861 INFO L78 Accepts]: Start accepts. Automaton has 35057 states and 45341 transitions. Word has length 132 [2021-11-06 20:44:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:47,861 INFO L470 AbstractCegarLoop]: Abstraction has 35057 states and 45341 transitions. [2021-11-06 20:44:47,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-06 20:44:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 35057 states and 45341 transitions. [2021-11-06 20:44:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-06 20:44:47,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:47,868 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:47,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 20:44:47,869 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1759562997, now seen corresponding path program 1 times [2021-11-06 20:44:47,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:47,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659134601] [2021-11-06 20:44:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:47,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:48,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:48,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659134601] [2021-11-06 20:44:48,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659134601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:48,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:48,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:48,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787342589] [2021-11-06 20:44:48,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:48,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:48,052 INFO L87 Difference]: Start difference. First operand 35057 states and 45341 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-06 20:44:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:48,812 INFO L93 Difference]: Finished difference Result 35057 states and 45341 transitions. [2021-11-06 20:44:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 134 [2021-11-06 20:44:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:48,871 INFO L225 Difference]: With dead ends: 35057 [2021-11-06 20:44:48,871 INFO L226 Difference]: Without dead ends: 35051 [2021-11-06 20:44:48,886 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35051 states. [2021-11-06 20:44:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35051 to 35051. [2021-11-06 20:44:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35051 states, 34533 states have (on average 1.2861610633307272) internal successors, (44415), 34550 states have internal predecessors, (44415), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35051 states to 35051 states and 45335 transitions. [2021-11-06 20:44:49,776 INFO L78 Accepts]: Start accepts. Automaton has 35051 states and 45335 transitions. Word has length 134 [2021-11-06 20:44:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:49,776 INFO L470 AbstractCegarLoop]: Abstraction has 35051 states and 45335 transitions. [2021-11-06 20:44:49,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-06 20:44:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 35051 states and 45335 transitions. [2021-11-06 20:44:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-06 20:44:49,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:49,785 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:49,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 20:44:49,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1276892584, now seen corresponding path program 1 times [2021-11-06 20:44:49,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:49,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43911195] [2021-11-06 20:44:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:49,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:50,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:50,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43911195] [2021-11-06 20:44:50,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43911195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:50,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:50,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:50,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816607586] [2021-11-06 20:44:50,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:50,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:50,105 INFO L87 Difference]: Start difference. First operand 35051 states and 45335 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 20:44:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:51,172 INFO L93 Difference]: Finished difference Result 35051 states and 45335 transitions. [2021-11-06 20:44:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2021-11-06 20:44:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:51,259 INFO L225 Difference]: With dead ends: 35051 [2021-11-06 20:44:51,259 INFO L226 Difference]: Without dead ends: 35045 [2021-11-06 20:44:51,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35045 states. [2021-11-06 20:44:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35045 to 35045. [2021-11-06 20:44:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35045 states, 34530 states have (on average 1.2860990443092963) internal successors, (44409), 34544 states have internal predecessors, (44409), 460 states have call successors, (460), 40 states have call predecessors, (460), 40 states have return successors, (460), 460 states have call predecessors, (460), 460 states have call successors, (460) [2021-11-06 20:44:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35045 states to 35045 states and 45329 transitions. [2021-11-06 20:44:52,219 INFO L78 Accepts]: Start accepts. Automaton has 35045 states and 45329 transitions. Word has length 136 [2021-11-06 20:44:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 20:44:52,220 INFO L470 AbstractCegarLoop]: Abstraction has 35045 states and 45329 transitions. [2021-11-06 20:44:52,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 20:44:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 35045 states and 45329 transitions. [2021-11-06 20:44:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-06 20:44:52,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 20:44:52,230 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:44:52,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 20:44:52,230 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 39 more)] === [2021-11-06 20:44:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 20:44:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1267055675, now seen corresponding path program 1 times [2021-11-06 20:44:52,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 20:44:52,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868783020] [2021-11-06 20:44:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 20:44:52,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 20:44:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 20:44:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 20:44:52,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 20:44:52,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868783020] [2021-11-06 20:44:52,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868783020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 20:44:52,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 20:44:52,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 20:44:52,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972154164] [2021-11-06 20:44:52,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 20:44:52,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 20:44:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 20:44:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 20:44:52,404 INFO L87 Difference]: Start difference. First operand 35045 states and 45329 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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-06 20:44:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 20:44:53,383 INFO L93 Difference]: Finished difference Result 35045 states and 45329 transitions. [2021-11-06 20:44:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 20:44:53,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 138 [2021-11-06 20:44:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 20:44:53,442 INFO L225 Difference]: With dead ends: 35045 [2021-11-06 20:44:53,442 INFO L226 Difference]: Without dead ends: 35039 [2021-11-06 20:44:53,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 20:44:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35039 states.