./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 16:15:24,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 16:15:24,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 16:15:25,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 16:15:25,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 16:15:25,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 16:15:25,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 16:15:25,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 16:15:25,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 16:15:25,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 16:15:25,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 16:15:25,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 16:15:25,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 16:15:25,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 16:15:25,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 16:15:25,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 16:15:25,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 16:15:25,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 16:15:25,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 16:15:25,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 16:15:25,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 16:15:25,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 16:15:25,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 16:15:25,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 16:15:25,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 16:15:25,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 16:15:25,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 16:15:25,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 16:15:25,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 16:15:25,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 16:15:25,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 16:15:25,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 16:15:25,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 16:15:25,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 16:15:25,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 16:15:25,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 16:15:25,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 16:15:25,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 16:15:25,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 16:15:25,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 16:15:25,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 16:15:25,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 16:15:25,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 16:15:25,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 16:15:25,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 16:15:25,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 16:15:25,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 16:15:25,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 16:15:25,080 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 16:15:25,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 16:15:25,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 16:15:25,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 16:15:25,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 16:15:25,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 16:15:25,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 16:15:25,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 16:15:25,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:15:25,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 16:15:25,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 16:15:25,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 16:15:25,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 16:15:25,089 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 -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2021-11-05 16:15:25,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 16:15:25,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 16:15:25,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 16:15:25,399 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 16:15:25,399 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 16:15:25,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-05 16:15:25,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46903ee/7d61f2b184fd4edea21769edf553c882/FLAGa167891bb [2021-11-05 16:15:25,993 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 16:15:25,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-05 16:15:26,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46903ee/7d61f2b184fd4edea21769edf553c882/FLAGa167891bb [2021-11-05 16:15:26,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46903ee/7d61f2b184fd4edea21769edf553c882 [2021-11-05 16:15:26,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 16:15:26,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 16:15:26,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 16:15:26,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 16:15:26,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 16:15:26,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:15:26" (1/1) ... [2021-11-05 16:15:26,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a47c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:26, skipping insertion in model container [2021-11-05 16:15:26,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:15:26" (1/1) ... [2021-11-05 16:15:26,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 16:15:26,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 16:15:27,003 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-05 16:15:27,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:15:27,206 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 16:15:27,383 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-05 16:15:27,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:15:27,543 INFO L208 MainTranslator]: Completed translation [2021-11-05 16:15:27,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27 WrapperNode [2021-11-05 16:15:27,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 16:15:27,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 16:15:27,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 16:15:27,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 16:15:27,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 16:15:27,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 16:15:27,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 16:15:27,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 16:15:27,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 16:15:27,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 16:15:27,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 16:15:27,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 16:15:27,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (1/1) ... [2021-11-05 16:15:27,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:15:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:15:27,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 16:15:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 16:15:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2021-11-05 16:15:27,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2021-11-05 16:15:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2021-11-05 16:15:27,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2021-11-05 16:15:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 16:15:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2021-11-05 16:15:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-05 16:15:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 16:15:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-05 16:15:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 16:15:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 16:15:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 16:15:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 16:15:27,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 16:15:29,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 16:15:29,702 INFO L299 CfgBuilder]: Removed 491 assume(true) statements. [2021-11-05 16:15:29,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:15:29 BoogieIcfgContainer [2021-11-05 16:15:29,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 16:15:29,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 16:15:29,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 16:15:29,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 16:15:29,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 04:15:26" (1/3) ... [2021-11-05 16:15:29,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b91de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:15:29, skipping insertion in model container [2021-11-05 16:15:29,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:15:27" (2/3) ... [2021-11-05 16:15:29,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b91de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:15:29, skipping insertion in model container [2021-11-05 16:15:29,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:15:29" (3/3) ... [2021-11-05 16:15:29,708 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-05 16:15:29,711 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 16:15:29,711 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-05 16:15:29,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 16:15:29,752 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 16:15:29,752 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-05 16:15:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 453 states, 434 states have (on average 1.3894009216589862) internal successors, (603), 440 states have internal predecessors, (603), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-05 16:15:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-05 16:15:29,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:29,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:29,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash 729149926, now seen corresponding path program 1 times [2021-11-05 16:15:29,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:29,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275431045] [2021-11-05 16:15:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:29,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:30,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:30,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275431045] [2021-11-05 16:15:30,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275431045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:30,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:30,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:15:30,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298805648] [2021-11-05 16:15:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:30,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:30,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,131 INFO L87 Difference]: Start difference. First operand has 453 states, 434 states have (on average 1.3894009216589862) internal successors, (603), 440 states have internal predecessors, (603), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:30,392 INFO L93 Difference]: Finished difference Result 1305 states and 1804 transitions. [2021-11-05 16:15:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-05 16:15:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:30,405 INFO L225 Difference]: With dead ends: 1305 [2021-11-05 16:15:30,405 INFO L226 Difference]: Without dead ends: 839 [2021-11-05 16:15:30,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.83ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,411 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 547 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.73ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 194.83ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:30,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1181 Invalid, 16 Unknown, 0 Unchecked, 6.73ms Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 194.83ms Time] [2021-11-05 16:15:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-05 16:15:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2021-11-05 16:15:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 808 states have (on average 1.3316831683168318) internal successors, (1076), 814 states have internal predecessors, (1076), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-05 16:15:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1108 transitions. [2021-11-05 16:15:30,470 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1108 transitions. Word has length 19 [2021-11-05 16:15:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:30,470 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1108 transitions. [2021-11-05 16:15:30,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1108 transitions. [2021-11-05 16:15:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-05 16:15:30,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:30,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:30,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 16:15:30,473 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1197836240, now seen corresponding path program 1 times [2021-11-05 16:15:30,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:30,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983621907] [2021-11-05 16:15:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:30,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:30,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:30,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983621907] [2021-11-05 16:15:30,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983621907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:30,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:30,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:15:30,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100534313] [2021-11-05 16:15:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:30,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:30,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,590 INFO L87 Difference]: Start difference. First operand 839 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:30,659 INFO L93 Difference]: Finished difference Result 869 states and 1136 transitions. [2021-11-05 16:15:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-05 16:15:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:30,663 INFO L225 Difference]: With dead ends: 869 [2021-11-05 16:15:30,663 INFO L226 Difference]: Without dead ends: 854 [2021-11-05 16:15:30,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,664 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 575 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.62ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:30,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 607 Invalid, 6 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 20.62ms Time] [2021-11-05 16:15:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-05 16:15:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 839. [2021-11-05 16:15:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 808 states have (on average 1.3304455445544554) internal successors, (1075), 814 states have internal predecessors, (1075), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-05 16:15:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1107 transitions. [2021-11-05 16:15:30,683 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1107 transitions. Word has length 26 [2021-11-05 16:15:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:30,683 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1107 transitions. [2021-11-05 16:15:30,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1107 transitions. [2021-11-05 16:15:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-05 16:15:30,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:30,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:30,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 16:15:30,685 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1197776658, now seen corresponding path program 1 times [2021-11-05 16:15:30,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:30,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630177828] [2021-11-05 16:15:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:30,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:30,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:30,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630177828] [2021-11-05 16:15:30,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630177828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:30,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:30,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 16:15:30,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308444686] [2021-11-05 16:15:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:30,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:30,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,774 INFO L87 Difference]: Start difference. First operand 839 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:30,859 INFO L93 Difference]: Finished difference Result 2479 states and 3326 transitions. [2021-11-05 16:15:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:30,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-05 16:15:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:30,864 INFO L225 Difference]: With dead ends: 2479 [2021-11-05 16:15:30,865 INFO L226 Difference]: Without dead ends: 1658 [2021-11-05 16:15:30,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,867 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 552 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.73ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.74ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:30,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 1110 Invalid, 53 Unknown, 0 Unchecked, 2.73ms Time], IncrementalHoareTripleChecker [16 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 46.74ms Time] [2021-11-05 16:15:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-11-05 16:15:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1646. [2021-11-05 16:15:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1589 states have (on average 1.3215859030837005) internal successors, (2100), 1597 states have internal predecessors, (2100), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-05 16:15:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2180 transitions. [2021-11-05 16:15:30,906 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2180 transitions. Word has length 26 [2021-11-05 16:15:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:30,906 INFO L470 AbstractCegarLoop]: Abstraction has 1646 states and 2180 transitions. [2021-11-05 16:15:30,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2180 transitions. [2021-11-05 16:15:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-05 16:15:30,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:30,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:30,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 16:15:30,908 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1523628889, now seen corresponding path program 1 times [2021-11-05 16:15:30,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:30,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924066655] [2021-11-05 16:15:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:30,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:30,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:30,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924066655] [2021-11-05 16:15:30,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924066655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:30,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:30,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 16:15:30,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050233230] [2021-11-05 16:15:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:30,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:30,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:30,989 INFO L87 Difference]: Start difference. First operand 1646 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,054 INFO L93 Difference]: Finished difference Result 1646 states and 2180 transitions. [2021-11-05 16:15:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-05 16:15:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:31,060 INFO L225 Difference]: With dead ends: 1646 [2021-11-05 16:15:31,060 INFO L226 Difference]: Without dead ends: 1644 [2021-11-05 16:15:31,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,061 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 553 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.37ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.73ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:31,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 577 Invalid, 1 Unknown, 0 Unchecked, 1.37ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.73ms Time] [2021-11-05 16:15:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2021-11-05 16:15:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2021-11-05 16:15:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1588 states have (on average 1.3211586901763224) internal successors, (2098), 1595 states have internal predecessors, (2098), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-05 16:15:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2178 transitions. [2021-11-05 16:15:31,103 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2178 transitions. Word has length 27 [2021-11-05 16:15:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:31,103 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 2178 transitions. [2021-11-05 16:15:31,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2178 transitions. [2021-11-05 16:15:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-05 16:15:31,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:31,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:31,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 16:15:31,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash -12145064, now seen corresponding path program 1 times [2021-11-05 16:15:31,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:31,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972696230] [2021-11-05 16:15:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:31,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:31,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:31,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972696230] [2021-11-05 16:15:31,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972696230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:31,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:31,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 16:15:31,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317064374] [2021-11-05 16:15:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:31,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:31,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,162 INFO L87 Difference]: Start difference. First operand 1644 states and 2178 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,196 INFO L93 Difference]: Finished difference Result 1644 states and 2178 transitions. [2021-11-05 16:15:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-05 16:15:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:31,202 INFO L225 Difference]: With dead ends: 1644 [2021-11-05 16:15:31,202 INFO L226 Difference]: Without dead ends: 1642 [2021-11-05 16:15:31,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.35ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,203 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 550 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.19ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.53ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:31,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 1.19ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.53ms Time] [2021-11-05 16:15:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2021-11-05 16:15:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2021-11-05 16:15:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1587 states have (on average 1.320730938878387) internal successors, (2096), 1593 states have internal predecessors, (2096), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-05 16:15:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2176 transitions. [2021-11-05 16:15:31,245 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2176 transitions. Word has length 28 [2021-11-05 16:15:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:31,245 INFO L470 AbstractCegarLoop]: Abstraction has 1642 states and 2176 transitions. [2021-11-05 16:15:31,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2176 transitions. [2021-11-05 16:15:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-05 16:15:31,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:31,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:31,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 16:15:31,247 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash -376497341, now seen corresponding path program 1 times [2021-11-05 16:15:31,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:31,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356896933] [2021-11-05 16:15:31,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:31,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:31,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:31,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356896933] [2021-11-05 16:15:31,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356896933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:31,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:31,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 16:15:31,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686677673] [2021-11-05 16:15:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:31,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:31,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,302 INFO L87 Difference]: Start difference. First operand 1642 states and 2176 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,370 INFO L93 Difference]: Finished difference Result 1642 states and 2176 transitions. [2021-11-05 16:15:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-05 16:15:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:31,375 INFO L225 Difference]: With dead ends: 1642 [2021-11-05 16:15:31,375 INFO L226 Difference]: Without dead ends: 1640 [2021-11-05 16:15:31,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,377 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 547 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.88ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:31,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 573 Invalid, 1 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.88ms Time] [2021-11-05 16:15:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-05 16:15:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-05 16:15:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1586 states have (on average 1.3203026481715006) internal successors, (2094), 1591 states have internal predecessors, (2094), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-05 16:15:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2174 transitions. [2021-11-05 16:15:31,430 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2174 transitions. Word has length 29 [2021-11-05 16:15:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:31,431 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 2174 transitions. [2021-11-05 16:15:31,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2174 transitions. [2021-11-05 16:15:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-05 16:15:31,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:31,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:31,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 16:15:31,432 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1213483970, now seen corresponding path program 1 times [2021-11-05 16:15:31,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:31,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078353548] [2021-11-05 16:15:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:31,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:31,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:31,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078353548] [2021-11-05 16:15:31,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078353548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:31,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:31,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 16:15:31,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82052292] [2021-11-05 16:15:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:31,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:31,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,492 INFO L87 Difference]: Start difference. First operand 1640 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,537 INFO L93 Difference]: Finished difference Result 1640 states and 2174 transitions. [2021-11-05 16:15:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-05 16:15:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:31,545 INFO L225 Difference]: With dead ends: 1640 [2021-11-05 16:15:31,545 INFO L226 Difference]: Without dead ends: 1631 [2021-11-05 16:15:31,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.39ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,548 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 544 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:31,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.59ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 16:15:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-11-05 16:15:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-11-05 16:15:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1578 states have (on average 1.320025348542459) internal successors, (2083), 1582 states have internal predecessors, (2083), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-05 16:15:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2163 transitions. [2021-11-05 16:15:31,604 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2163 transitions. Word has length 30 [2021-11-05 16:15:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:31,604 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2163 transitions. [2021-11-05 16:15:31,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2163 transitions. [2021-11-05 16:15:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 16:15:31,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:31,609 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-05 16:15:31,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 16:15:31,610 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:31,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2139707916, now seen corresponding path program 1 times [2021-11-05 16:15:31,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:31,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103290071] [2021-11-05 16:15:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:31,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:15:31,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:31,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103290071] [2021-11-05 16:15:31,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103290071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:31,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:31,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:15:31,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471322624] [2021-11-05 16:15:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:31,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:31,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,689 INFO L87 Difference]: Start difference. First operand 1631 states and 2163 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,771 INFO L93 Difference]: Finished difference Result 4178 states and 5567 transitions. [2021-11-05 16:15:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 16:15:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:31,778 INFO L225 Difference]: With dead ends: 4178 [2021-11-05 16:15:31,778 INFO L226 Difference]: Without dead ends: 2565 [2021-11-05 16:15:31,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,781 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 332 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.73ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.21ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:31,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 1117 Invalid, 12 Unknown, 0 Unchecked, 1.73ms Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 23.21ms Time] [2021-11-05 16:15:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2021-11-05 16:15:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2557. [2021-11-05 16:15:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2452 states have (on average 1.3270799347471451) internal successors, (3254), 2460 states have internal predecessors, (3254), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3414 transitions. [2021-11-05 16:15:31,865 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3414 transitions. Word has length 87 [2021-11-05 16:15:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:31,865 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 3414 transitions. [2021-11-05 16:15:31,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3414 transitions. [2021-11-05 16:15:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-05 16:15:31,868 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:31,869 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:31,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 16:15:31,869 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash -413485961, now seen corresponding path program 1 times [2021-11-05 16:15:31,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:31,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504129090] [2021-11-05 16:15:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:31,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:31,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:31,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504129090] [2021-11-05 16:15:31,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504129090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:31,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:31,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:15:31,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086513218] [2021-11-05 16:15:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:31,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:31,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:31,934 INFO L87 Difference]: Start difference. First operand 2557 states and 3414 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:31,997 INFO L93 Difference]: Finished difference Result 5100 states and 6815 transitions. [2021-11-05 16:15:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-05 16:15:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:32,005 INFO L225 Difference]: With dead ends: 5100 [2021-11-05 16:15:32,005 INFO L226 Difference]: Without dead ends: 2561 [2021-11-05 16:15:32,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.34ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:32,009 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.71ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:32,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1129 Invalid, 6 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 4.71ms Time] [2021-11-05 16:15:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2021-11-05 16:15:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2021-11-05 16:15:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2456 states have (on average 1.3265472312703583) internal successors, (3258), 2464 states have internal predecessors, (3258), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3418 transitions. [2021-11-05 16:15:32,070 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3418 transitions. Word has length 95 [2021-11-05 16:15:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:32,070 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 3418 transitions. [2021-11-05 16:15:32,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3418 transitions. [2021-11-05 16:15:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-05 16:15:32,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:32,073 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:32,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 16:15:32,074 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1514786741, now seen corresponding path program 1 times [2021-11-05 16:15:32,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:32,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217707472] [2021-11-05 16:15:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:32,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:32,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:32,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217707472] [2021-11-05 16:15:32,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217707472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:32,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:32,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:15:32,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582102509] [2021-11-05 16:15:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:32,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:15:32,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:32,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:15:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:32,185 INFO L87 Difference]: Start difference. First operand 2561 states and 3418 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:32,431 INFO L93 Difference]: Finished difference Result 8529 states and 11530 transitions. [2021-11-05 16:15:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:15:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-05 16:15:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:32,449 INFO L225 Difference]: With dead ends: 8529 [2021-11-05 16:15:32,449 INFO L226 Difference]: Without dead ends: 5986 [2021-11-05 16:15:32,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.86ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:15:32,456 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1223 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.25ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.92ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:32,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1225 Valid, 3420 Invalid, 46 Unknown, 0 Unchecked, 5.25ms Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 34.92ms Time] [2021-11-05 16:15:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2021-11-05 16:15:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 2573. [2021-11-05 16:15:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2468 states have (on average 1.3249594813614263) internal successors, (3270), 2476 states have internal predecessors, (3270), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3430 transitions. [2021-11-05 16:15:32,578 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3430 transitions. Word has length 95 [2021-11-05 16:15:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:32,579 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 3430 transitions. [2021-11-05 16:15:32,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3430 transitions. [2021-11-05 16:15:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-05 16:15:32,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:32,586 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:32,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 16:15:32,586 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -95826638, now seen corresponding path program 1 times [2021-11-05 16:15:32,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:32,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24991008] [2021-11-05 16:15:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:32,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:32,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:32,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24991008] [2021-11-05 16:15:32,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24991008] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:32,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:32,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:15:32,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648787944] [2021-11-05 16:15:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:32,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:15:32,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:15:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:15:32,737 INFO L87 Difference]: Start difference. First operand 2573 states and 3430 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:32,974 INFO L93 Difference]: Finished difference Result 6631 states and 8884 transitions. [2021-11-05 16:15:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:15:32,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-05 16:15:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:32,990 INFO L225 Difference]: With dead ends: 6631 [2021-11-05 16:15:32,990 INFO L226 Difference]: Without dead ends: 4068 [2021-11-05 16:15:32,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.66ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:32,997 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 349 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.96ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:32,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 2066 Invalid, 52 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 36.96ms Time] [2021-11-05 16:15:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2021-11-05 16:15:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2573. [2021-11-05 16:15:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2468 states have (on average 1.3233387358184765) internal successors, (3266), 2476 states have internal predecessors, (3266), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3426 transitions. [2021-11-05 16:15:33,138 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3426 transitions. Word has length 101 [2021-11-05 16:15:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:33,138 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 3426 transitions. [2021-11-05 16:15:33,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3426 transitions. [2021-11-05 16:15:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-05 16:15:33,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:33,142 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:33,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 16:15:33,142 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -684740018, now seen corresponding path program 1 times [2021-11-05 16:15:33,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:33,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105837249] [2021-11-05 16:15:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:33,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:33,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:33,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105837249] [2021-11-05 16:15:33,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105837249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:33,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:33,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:15:33,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880509654] [2021-11-05 16:15:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:33,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:15:33,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:15:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:33,377 INFO L87 Difference]: Start difference. First operand 2573 states and 3426 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:33,733 INFO L93 Difference]: Finished difference Result 7694 states and 10341 transitions. [2021-11-05 16:15:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:15:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-05 16:15:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:33,760 INFO L225 Difference]: With dead ends: 7694 [2021-11-05 16:15:33,760 INFO L226 Difference]: Without dead ends: 5139 [2021-11-05 16:15:33,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.50ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:15:33,767 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 960 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.50ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.20ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:33,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [962 Valid, 2855 Invalid, 75 Unknown, 0 Unchecked, 5.50ms Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 58.20ms Time] [2021-11-05 16:15:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2021-11-05 16:15:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 2585. [2021-11-05 16:15:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2480 states have (on average 1.321774193548387) internal successors, (3278), 2488 states have internal predecessors, (3278), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3438 transitions. [2021-11-05 16:15:33,880 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3438 transitions. Word has length 103 [2021-11-05 16:15:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:33,880 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 3438 transitions. [2021-11-05 16:15:33,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3438 transitions. [2021-11-05 16:15:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-05 16:15:33,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:33,885 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:33,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 16:15:33,885 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1980304342, now seen corresponding path program 1 times [2021-11-05 16:15:33,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:33,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366297610] [2021-11-05 16:15:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:33,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:34,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:34,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366297610] [2021-11-05 16:15:34,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366297610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:34,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:34,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:15:34,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299722344] [2021-11-05 16:15:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:34,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:15:34,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:15:34,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:34,014 INFO L87 Difference]: Start difference. First operand 2585 states and 3438 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:34,437 INFO L93 Difference]: Finished difference Result 9796 states and 13227 transitions. [2021-11-05 16:15:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:15:34,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 105 [2021-11-05 16:15:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:34,456 INFO L225 Difference]: With dead ends: 9796 [2021-11-05 16:15:34,456 INFO L226 Difference]: Without dead ends: 7229 [2021-11-05 16:15:34,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.17ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:15:34,463 INFO L933 BasicCegarLoop]: 987 mSDtfsCounter, 1205 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.19ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.71ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:34,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 3501 Invalid, 84 Unknown, 0 Unchecked, 10.19ms Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 61.71ms Time] [2021-11-05 16:15:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2021-11-05 16:15:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 2597. [2021-11-05 16:15:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2492 states have (on average 1.3202247191011236) internal successors, (3290), 2500 states have internal predecessors, (3290), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3450 transitions. [2021-11-05 16:15:34,650 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3450 transitions. Word has length 105 [2021-11-05 16:15:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:34,650 INFO L470 AbstractCegarLoop]: Abstraction has 2597 states and 3450 transitions. [2021-11-05 16:15:34,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3450 transitions. [2021-11-05 16:15:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-05 16:15:34,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:34,656 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:15:34,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 16:15:34,656 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1864851898, now seen corresponding path program 1 times [2021-11-05 16:15:34,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:34,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406429622] [2021-11-05 16:15:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:34,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:34,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:34,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406429622] [2021-11-05 16:15:34,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406429622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:34,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:34,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 16:15:34,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652160604] [2021-11-05 16:15:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 16:15:34,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 16:15:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 16:15:34,788 INFO L87 Difference]: Start difference. First operand 2597 states and 3450 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:35,231 INFO L93 Difference]: Finished difference Result 8805 states and 11838 transitions. [2021-11-05 16:15:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:15:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-05 16:15:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:35,242 INFO L225 Difference]: With dead ends: 8805 [2021-11-05 16:15:35,242 INFO L226 Difference]: Without dead ends: 6226 [2021-11-05 16:15:35,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.99ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-05 16:15:35,246 INFO L933 BasicCegarLoop]: 1054 mSDtfsCounter, 1241 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.29ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.39ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:35,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 4416 Invalid, 103 Unknown, 0 Unchecked, 7.29ms Time], IncrementalHoareTripleChecker [19 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 62.39ms Time] [2021-11-05 16:15:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2021-11-05 16:15:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 2613. [2021-11-05 16:15:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2508 states have (on average 1.3181818181818181) internal successors, (3306), 2516 states have internal predecessors, (3306), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3466 transitions. [2021-11-05 16:15:35,385 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3466 transitions. Word has length 107 [2021-11-05 16:15:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:35,386 INFO L470 AbstractCegarLoop]: Abstraction has 2613 states and 3466 transitions. [2021-11-05 16:15:35,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3466 transitions. [2021-11-05 16:15:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-05 16:15:35,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:35,389 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:35,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 16:15:35,390 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -691380734, now seen corresponding path program 1 times [2021-11-05 16:15:35,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:35,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43421195] [2021-11-05 16:15:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:35,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:35,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:35,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43421195] [2021-11-05 16:15:35,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43421195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:35,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:35,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:15:35,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889823763] [2021-11-05 16:15:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:35,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:15:35,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:15:35,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:35,495 INFO L87 Difference]: Start difference. First operand 2613 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:35,753 INFO L93 Difference]: Finished difference Result 6519 states and 8684 transitions. [2021-11-05 16:15:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:15:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 109 [2021-11-05 16:15:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:35,761 INFO L225 Difference]: With dead ends: 6519 [2021-11-05 16:15:35,761 INFO L226 Difference]: Without dead ends: 3924 [2021-11-05 16:15:35,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.42ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:15:35,767 INFO L933 BasicCegarLoop]: 835 mSDtfsCounter, 378 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.78ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.76ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:35,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 1305 Invalid, 3 Unknown, 0 Unchecked, 1.78ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.76ms Time] [2021-11-05 16:15:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2021-11-05 16:15:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 2601. [2021-11-05 16:15:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2496 states have (on average 1.3149038461538463) internal successors, (3282), 2504 states have internal predecessors, (3282), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 3442 transitions. [2021-11-05 16:15:35,946 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 3442 transitions. Word has length 109 [2021-11-05 16:15:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:35,946 INFO L470 AbstractCegarLoop]: Abstraction has 2601 states and 3442 transitions. [2021-11-05 16:15:35,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3442 transitions. [2021-11-05 16:15:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-05 16:15:35,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:35,950 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:35,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 16:15:35,950 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1209705982, now seen corresponding path program 1 times [2021-11-05 16:15:35,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:35,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664726571] [2021-11-05 16:15:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:35,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:36,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:36,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664726571] [2021-11-05 16:15:36,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664726571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:36,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:36,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:15:36,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178323350] [2021-11-05 16:15:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:36,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:15:36,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:36,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:15:36,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:15:36,058 INFO L87 Difference]: Start difference. First operand 2601 states and 3442 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:36,621 INFO L93 Difference]: Finished difference Result 9205 states and 12302 transitions. [2021-11-05 16:15:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:15:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 109 [2021-11-05 16:15:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:36,632 INFO L225 Difference]: With dead ends: 9205 [2021-11-05 16:15:36,633 INFO L226 Difference]: Without dead ends: 6622 [2021-11-05 16:15:36,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.91ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:36,636 INFO L933 BasicCegarLoop]: 1062 mSDtfsCounter, 970 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.30ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.95ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:36,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 2700 Invalid, 78 Unknown, 0 Unchecked, 6.30ms Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 68.95ms Time] [2021-11-05 16:15:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2021-11-05 16:15:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 2633. [2021-11-05 16:15:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2528 states have (on average 1.3140822784810127) internal successors, (3322), 2536 states have internal predecessors, (3322), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3482 transitions. [2021-11-05 16:15:36,802 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3482 transitions. Word has length 109 [2021-11-05 16:15:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:36,803 INFO L470 AbstractCegarLoop]: Abstraction has 2633 states and 3482 transitions. [2021-11-05 16:15:36,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3482 transitions. [2021-11-05 16:15:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-05 16:15:36,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:36,806 INFO L514 BasicCegarLoop]: trace histogram [3, 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-05 16:15:36,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 16:15:36,806 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -559598042, now seen corresponding path program 1 times [2021-11-05 16:15:36,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:36,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65404877] [2021-11-05 16:15:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:36,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:36,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:36,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65404877] [2021-11-05 16:15:36,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65404877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:36,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:36,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:15:36,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444125981] [2021-11-05 16:15:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:36,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:15:36,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:15:36,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:15:36,947 INFO L87 Difference]: Start difference. First operand 2633 states and 3482 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:37,342 INFO L93 Difference]: Finished difference Result 6575 states and 8744 transitions. [2021-11-05 16:15:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:15:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 111 [2021-11-05 16:15:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:37,350 INFO L225 Difference]: With dead ends: 6575 [2021-11-05 16:15:37,350 INFO L226 Difference]: Without dead ends: 3960 [2021-11-05 16:15:37,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:15:37,357 INFO L933 BasicCegarLoop]: 843 mSDtfsCounter, 378 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.91ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:37,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 2143 Invalid, 19 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 113.91ms Time] [2021-11-05 16:15:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2021-11-05 16:15:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2637. [2021-11-05 16:15:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2532 states have (on average 1.3135860979462874) internal successors, (3326), 2540 states have internal predecessors, (3326), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3486 transitions. [2021-11-05 16:15:37,567 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3486 transitions. Word has length 111 [2021-11-05 16:15:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:37,568 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 3486 transitions. [2021-11-05 16:15:37,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3486 transitions. [2021-11-05 16:15:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-05 16:15:37,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:37,571 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-05 16:15:37,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 16:15:37,571 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1932447274, now seen corresponding path program 1 times [2021-11-05 16:15:37,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:37,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363666532] [2021-11-05 16:15:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:37,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:37,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:37,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363666532] [2021-11-05 16:15:37,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363666532] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:15:37,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676574427] [2021-11-05 16:15:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:37,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:37,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:15:37,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:15:37,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-05 16:15:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:38,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 16:15:38,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:15:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:38,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:15:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 16:15:38,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676574427] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-05 16:15:38,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-05 16:15:38,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2021-11-05 16:15:38,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507933532] [2021-11-05 16:15:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:38,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:15:38,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:15:38,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:38,623 INFO L87 Difference]: Start difference. First operand 2637 states and 3486 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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-05 16:15:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:39,021 INFO L93 Difference]: Finished difference Result 6623 states and 8808 transitions. [2021-11-05 16:15:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:15:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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 112 [2021-11-05 16:15:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:39,028 INFO L225 Difference]: With dead ends: 6623 [2021-11-05 16:15:39,029 INFO L226 Difference]: Without dead ends: 4004 [2021-11-05 16:15:39,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 38.99ms TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:39,033 INFO L933 BasicCegarLoop]: 836 mSDtfsCounter, 380 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.37ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 134.68ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:39,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1678 Invalid, 30 Unknown, 0 Unchecked, 2.37ms Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 134.68ms Time] [2021-11-05 16:15:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2021-11-05 16:15:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 2657. [2021-11-05 16:15:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2552 states have (on average 1.3142633228840126) internal successors, (3354), 2560 states have internal predecessors, (3354), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3514 transitions. [2021-11-05 16:15:39,187 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3514 transitions. Word has length 112 [2021-11-05 16:15:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:39,187 INFO L470 AbstractCegarLoop]: Abstraction has 2657 states and 3514 transitions. [2021-11-05 16:15:39,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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-05 16:15:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3514 transitions. [2021-11-05 16:15:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-05 16:15:39,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:39,190 INFO L514 BasicCegarLoop]: trace histogram [3, 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-05 16:15:39,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-05 16:15:39,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-05 16:15:39,411 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1942200796, now seen corresponding path program 1 times [2021-11-05 16:15:39,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:39,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071632835] [2021-11-05 16:15:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:39,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 16:15:39,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:39,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071632835] [2021-11-05 16:15:39,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071632835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:15:39,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246709036] [2021-11-05 16:15:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:39,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:15:39,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:15:39,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-05 16:15:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:41,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1995 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-05 16:15:41,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:15:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 16:15:41,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:15:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 16:15:41,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246709036] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:15:41,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:15:41,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-11-05 16:15:41,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409162825] [2021-11-05 16:15:41,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:15:41,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 16:15:41,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 16:15:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:41,476 INFO L87 Difference]: Start difference. First operand 2657 states and 3514 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:42,240 INFO L93 Difference]: Finished difference Result 7238 states and 9635 transitions. [2021-11-05 16:15:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 16:15:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 113 [2021-11-05 16:15:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:42,249 INFO L225 Difference]: With dead ends: 7238 [2021-11-05 16:15:42,249 INFO L226 Difference]: Without dead ends: 4599 [2021-11-05 16:15:42,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 92.99ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-05 16:15:42,254 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 773 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 347.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 374.35ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:42,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 4017 Invalid, 65 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 374.35ms Time] [2021-11-05 16:15:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2021-11-05 16:15:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 2669. [2021-11-05 16:15:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2564 states have (on average 1.312792511700468) internal successors, (3366), 2572 states have internal predecessors, (3366), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3526 transitions. [2021-11-05 16:15:42,520 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3526 transitions. Word has length 113 [2021-11-05 16:15:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:42,520 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 3526 transitions. [2021-11-05 16:15:42,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3526 transitions. [2021-11-05 16:15:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-05 16:15:42,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:42,528 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-11-05 16:15:42,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-05 16:15:42,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:42,729 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1797060564, now seen corresponding path program 2 times [2021-11-05 16:15:42,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:42,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702220386] [2021-11-05 16:15:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:42,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 16:15:42,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:42,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702220386] [2021-11-05 16:15:42,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702220386] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:15:42,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363889960] [2021-11-05 16:15:42,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-05 16:15:42,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:15:42,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:15:42,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-05 16:15:43,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-05 16:15:43,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-05 16:15:43,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-05 16:15:43,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:15:44,043 INFO L354 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2021-11-05 16:15:44,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2021-11-05 16:15:44,104 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-05 16:15:44,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2021-11-05 16:15:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-05 16:15:44,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:15:44,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363889960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:44,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:15:44,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2021-11-05 16:15:44,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629650520] [2021-11-05 16:15:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:44,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 16:15:44,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:44,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 16:15:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-05 16:15:44,222 INFO L87 Difference]: Start difference. First operand 2669 states and 3526 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:46,168 INFO L93 Difference]: Finished difference Result 6290 states and 8363 transitions. [2021-11-05 16:15:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 16:15:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-11-05 16:15:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:46,176 INFO L225 Difference]: With dead ends: 6290 [2021-11-05 16:15:46,176 INFO L226 Difference]: Without dead ends: 3639 [2021-11-05 16:15:46,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 230.14ms TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-11-05 16:15:46,181 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 896 mSDsluCounter, 3740 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1252.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.63ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1452.39ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:46,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 4444 Invalid, 683 Unknown, 0 Unchecked, 12.63ms Time], IncrementalHoareTripleChecker [36 Valid, 568 Invalid, 0 Unknown, 79 Unchecked, 1452.39ms Time] [2021-11-05 16:15:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2021-11-05 16:15:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3112. [2021-11-05 16:15:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 3007 states have (on average 1.3185899567675423) internal successors, (3965), 3015 states have internal predecessors, (3965), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4125 transitions. [2021-11-05 16:15:46,399 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4125 transitions. Word has length 116 [2021-11-05 16:15:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:46,400 INFO L470 AbstractCegarLoop]: Abstraction has 3112 states and 4125 transitions. [2021-11-05 16:15:46,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:15:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4125 transitions. [2021-11-05 16:15:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-05 16:15:46,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:46,404 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 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] [2021-11-05 16:15:46,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-05 16:15:46,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:46,619 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 86546415, now seen corresponding path program 1 times [2021-11-05 16:15:46,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:46,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478757938] [2021-11-05 16:15:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:46,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-05 16:15:46,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:46,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478757938] [2021-11-05 16:15:46,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478757938] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:15:46,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809108549] [2021-11-05 16:15:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:46,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:15:46,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:15:46,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-05 16:15:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:48,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-05 16:15:48,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:15:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-05 16:15:49,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:15:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-05 16:15:49,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809108549] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:15:49,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:15:49,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2021-11-05 16:15:49,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138730540] [2021-11-05 16:15:49,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:15:49,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-05 16:15:49,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-05 16:15:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-11-05 16:15:49,435 INFO L87 Difference]: Start difference. First operand 3112 states and 4125 transitions. Second operand has 15 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 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-05 16:15:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:51,816 INFO L93 Difference]: Finished difference Result 13033 states and 17358 transitions. [2021-11-05 16:15:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-05 16:15:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 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 118 [2021-11-05 16:15:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:51,837 INFO L225 Difference]: With dead ends: 13033 [2021-11-05 16:15:51,837 INFO L226 Difference]: Without dead ends: 10382 [2021-11-05 16:15:51,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 322.76ms TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2021-11-05 16:15:51,886 INFO L933 BasicCegarLoop]: 1792 mSDtfsCounter, 2399 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1206.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 9858 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.24ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1264.82ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:51,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 9858 Invalid, 239 Unknown, 0 Unchecked, 20.24ms Time], IncrementalHoareTripleChecker [51 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1264.82ms Time] [2021-11-05 16:15:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2021-11-05 16:15:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 3136. [2021-11-05 16:15:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3031 states have (on average 1.3200263939293961) internal successors, (4001), 3039 states have internal predecessors, (4001), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4161 transitions. [2021-11-05 16:15:52,163 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4161 transitions. Word has length 118 [2021-11-05 16:15:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:52,163 INFO L470 AbstractCegarLoop]: Abstraction has 3136 states and 4161 transitions. [2021-11-05 16:15:52,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 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-05 16:15:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4161 transitions. [2021-11-05 16:15:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-05 16:15:52,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:52,167 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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] [2021-11-05 16:15:52,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-05 16:15:52,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:15:52,395 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -562346193, now seen corresponding path program 2 times [2021-11-05 16:15:52,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:52,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855637441] [2021-11-05 16:15:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:52,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:15:52,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:52,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855637441] [2021-11-05 16:15:52,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855637441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:52,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:52,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 16:15:52,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714246762] [2021-11-05 16:15:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:52,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 16:15:52,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 16:15:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:52,723 INFO L87 Difference]: Start difference. First operand 3136 states and 4161 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-05 16:15:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:55,529 INFO L93 Difference]: Finished difference Result 13811 states and 18538 transitions. [2021-11-05 16:15:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-05 16:15:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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 120 [2021-11-05 16:15:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:55,569 INFO L225 Difference]: With dead ends: 13811 [2021-11-05 16:15:55,569 INFO L226 Difference]: Without dead ends: 11136 [2021-11-05 16:15:55,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 504.67ms TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2021-11-05 16:15:55,578 INFO L933 BasicCegarLoop]: 3381 mSDtfsCounter, 4098 mSDsluCounter, 11572 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 878.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 14953 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.71ms SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1044.31ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:55,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4100 Valid, 14953 Invalid, 1077 Unknown, 0 Unchecked, 22.71ms Time], IncrementalHoareTripleChecker [231 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1044.31ms Time] [2021-11-05 16:15:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2021-11-05 16:15:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 3136. [2021-11-05 16:15:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3031 states have (on average 1.3193665456944903) internal successors, (3999), 3039 states have internal predecessors, (3999), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4159 transitions. [2021-11-05 16:15:56,073 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4159 transitions. Word has length 120 [2021-11-05 16:15:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:56,075 INFO L470 AbstractCegarLoop]: Abstraction has 3136 states and 4159 transitions. [2021-11-05 16:15:56,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-05 16:15:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4159 transitions. [2021-11-05 16:15:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-05 16:15:56,079 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:56,079 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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] [2021-11-05 16:15:56,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 16:15:56,079 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash -142868963, now seen corresponding path program 1 times [2021-11-05 16:15:56,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:56,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931596905] [2021-11-05 16:15:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:56,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:15:56,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:56,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931596905] [2021-11-05 16:15:56,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931596905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:56,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:56,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:15:56,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278143956] [2021-11-05 16:15:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:56,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 16:15:56,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 16:15:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 16:15:56,314 INFO L87 Difference]: Start difference. First operand 3136 states and 4159 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 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-05 16:15:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:56,876 INFO L93 Difference]: Finished difference Result 6516 states and 8639 transitions. [2021-11-05 16:15:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:15:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 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 130 [2021-11-05 16:15:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:56,886 INFO L225 Difference]: With dead ends: 6516 [2021-11-05 16:15:56,886 INFO L226 Difference]: Without dead ends: 3841 [2021-11-05 16:15:56,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.11ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:56,891 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 1444 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106.24ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:56,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1444 Valid, 3043 Invalid, 117 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [19 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 106.24ms Time] [2021-11-05 16:15:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2021-11-05 16:15:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3074. [2021-11-05 16:15:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2969 states have (on average 1.3192994274166385) internal successors, (3917), 2977 states have internal predecessors, (3917), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:15:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4077 transitions. [2021-11-05 16:15:57,186 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4077 transitions. Word has length 130 [2021-11-05 16:15:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:15:57,186 INFO L470 AbstractCegarLoop]: Abstraction has 3074 states and 4077 transitions. [2021-11-05 16:15:57,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 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-05 16:15:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4077 transitions. [2021-11-05 16:15:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-05 16:15:57,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:15:57,190 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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] [2021-11-05 16:15:57,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-05 16:15:57,190 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:15:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:15:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1319018799, now seen corresponding path program 1 times [2021-11-05 16:15:57,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:15:57,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946589082] [2021-11-05 16:15:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:15:57,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:15:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:15:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:15:57,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:15:57,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946589082] [2021-11-05 16:15:57,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946589082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:15:57,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:15:57,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 16:15:57,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254714580] [2021-11-05 16:15:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:15:57,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 16:15:57,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:15:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 16:15:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:15:57,495 INFO L87 Difference]: Start difference. First operand 3074 states and 4077 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 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-05 16:15:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:15:59,854 INFO L93 Difference]: Finished difference Result 12261 states and 16424 transitions. [2021-11-05 16:15:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-05 16:15:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 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 130 [2021-11-05 16:15:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:15:59,868 INFO L225 Difference]: With dead ends: 12261 [2021-11-05 16:15:59,869 INFO L226 Difference]: Without dead ends: 9648 [2021-11-05 16:15:59,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 454.34ms TimeCoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2021-11-05 16:15:59,873 INFO L933 BasicCegarLoop]: 2198 mSDtfsCounter, 4103 mSDsluCounter, 10544 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 479.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4105 SdHoareTripleChecker+Valid, 12742 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.14ms SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 629.20ms IncrementalHoareTripleChecker+Time [2021-11-05 16:15:59,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4105 Valid, 12742 Invalid, 721 Unknown, 0 Unchecked, 14.14ms Time], IncrementalHoareTripleChecker [171 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 629.20ms Time] [2021-11-05 16:15:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9648 states. [2021-11-05 16:16:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9648 to 3074. [2021-11-05 16:16:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2969 states have (on average 1.3186257999326372) internal successors, (3915), 2977 states have internal predecessors, (3915), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:16:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4075 transitions. [2021-11-05 16:16:00,199 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4075 transitions. Word has length 130 [2021-11-05 16:16:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:00,200 INFO L470 AbstractCegarLoop]: Abstraction has 3074 states and 4075 transitions. [2021-11-05 16:16:00,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 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-05 16:16:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4075 transitions. [2021-11-05 16:16:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-05 16:16:00,203 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:00,203 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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-05 16:16:00,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 16:16:00,204 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash -519921123, now seen corresponding path program 1 times [2021-11-05 16:16:00,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:00,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95527436] [2021-11-05 16:16:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:00,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:00,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:00,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95527436] [2021-11-05 16:16:00,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95527436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:00,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:00,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:16:00,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243351650] [2021-11-05 16:16:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:00,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:16:00,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:16:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:16:00,299 INFO L87 Difference]: Start difference. First operand 3074 states and 4075 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:01,266 INFO L93 Difference]: Finished difference Result 9328 states and 12517 transitions. [2021-11-05 16:16:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:16:01,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 135 [2021-11-05 16:16:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:01,298 INFO L225 Difference]: With dead ends: 9328 [2021-11-05 16:16:01,298 INFO L226 Difference]: Without dead ends: 6715 [2021-11-05 16:16:01,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:01,309 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 818 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.54ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.89ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:01,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 2643 Invalid, 35 Unknown, 0 Unchecked, 2.54ms Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 30.89ms Time] [2021-11-05 16:16:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2021-11-05 16:16:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 3078. [2021-11-05 16:16:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2973 states have (on average 1.3181971072990246) internal successors, (3919), 2981 states have internal predecessors, (3919), 64 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (96), 64 states have call predecessors, (96), 64 states have call successors, (96) [2021-11-05 16:16:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4079 transitions. [2021-11-05 16:16:01,648 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4079 transitions. Word has length 135 [2021-11-05 16:16:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:01,648 INFO L470 AbstractCegarLoop]: Abstraction has 3078 states and 4079 transitions. [2021-11-05 16:16:01,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4079 transitions. [2021-11-05 16:16:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-05 16:16:01,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:01,651 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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] [2021-11-05 16:16:01,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-05 16:16:01,652 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1589348198, now seen corresponding path program 1 times [2021-11-05 16:16:01,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:01,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928988449] [2021-11-05 16:16:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:01,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:02,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:02,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928988449] [2021-11-05 16:16:02,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928988449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:02,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:02,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 16:16:02,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033676945] [2021-11-05 16:16:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:02,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 16:16:02,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 16:16:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-05 16:16:02,282 INFO L87 Difference]: Start difference. First operand 3078 states and 4079 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 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-05 16:16:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:07,436 INFO L93 Difference]: Finished difference Result 13943 states and 18750 transitions. [2021-11-05 16:16:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-05 16:16:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 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 136 [2021-11-05 16:16:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:07,468 INFO L225 Difference]: With dead ends: 13943 [2021-11-05 16:16:07,468 INFO L226 Difference]: Without dead ends: 11296 [2021-11-05 16:16:07,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1498.33ms TimeCoverageRelationStatistics Valid=862, Invalid=2920, Unknown=0, NotChecked=0, Total=3782 [2021-11-05 16:16:07,483 INFO L933 BasicCegarLoop]: 2083 mSDtfsCounter, 6850 mSDsluCounter, 9296 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1492.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6850 SdHoareTripleChecker+Valid, 11379 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.76ms SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1709.68ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:07,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6850 Valid, 11379 Invalid, 1396 Unknown, 0 Unchecked, 22.76ms Time], IncrementalHoareTripleChecker [225 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1709.68ms Time] [2021-11-05 16:16:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2021-11-05 16:16:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 4355. [2021-11-05 16:16:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4355 states, 4198 states have (on average 1.3134826107670319) internal successors, (5514), 4210 states have internal predecessors, (5514), 96 states have call successors, (96), 60 states have call predecessors, (96), 60 states have return successors, (128), 96 states have call predecessors, (128), 96 states have call successors, (128) [2021-11-05 16:16:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 5738 transitions. [2021-11-05 16:16:08,198 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 5738 transitions. Word has length 136 [2021-11-05 16:16:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:08,198 INFO L470 AbstractCegarLoop]: Abstraction has 4355 states and 5738 transitions. [2021-11-05 16:16:08,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 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-05 16:16:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 5738 transitions. [2021-11-05 16:16:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-05 16:16:08,202 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:08,202 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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-05 16:16:08,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-05 16:16:08,203 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1438369931, now seen corresponding path program 1 times [2021-11-05 16:16:08,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:08,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270493222] [2021-11-05 16:16:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:08,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:08,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:08,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270493222] [2021-11-05 16:16:08,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270493222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:08,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:08,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:16:08,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891203875] [2021-11-05 16:16:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:08,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:16:08,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:16:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:16:08,303 INFO L87 Difference]: Start difference. First operand 4355 states and 5738 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:09,848 INFO L93 Difference]: Finished difference Result 14188 states and 18781 transitions. [2021-11-05 16:16:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:16:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 137 [2021-11-05 16:16:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:09,864 INFO L225 Difference]: With dead ends: 14188 [2021-11-05 16:16:09,865 INFO L226 Difference]: Without dead ends: 10294 [2021-11-05 16:16:09,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.29ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:09,870 INFO L933 BasicCegarLoop]: 762 mSDtfsCounter, 785 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.69ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:09,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 1869 Invalid, 16 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 27.69ms Time] [2021-11-05 16:16:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2021-11-05 16:16:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 4367. [2021-11-05 16:16:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 4210 states have (on average 1.3125890736342043) internal successors, (5526), 4222 states have internal predecessors, (5526), 96 states have call successors, (96), 60 states have call predecessors, (96), 60 states have return successors, (128), 96 states have call predecessors, (128), 96 states have call successors, (128) [2021-11-05 16:16:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 5750 transitions. [2021-11-05 16:16:10,451 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 5750 transitions. Word has length 137 [2021-11-05 16:16:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:10,452 INFO L470 AbstractCegarLoop]: Abstraction has 4367 states and 5750 transitions. [2021-11-05 16:16:10,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 5750 transitions. [2021-11-05 16:16:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-05 16:16:10,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:10,455 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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-05 16:16:10,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-05 16:16:10,456 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 737305353, now seen corresponding path program 1 times [2021-11-05 16:16:10,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:10,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586290405] [2021-11-05 16:16:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:10,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:10,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:10,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586290405] [2021-11-05 16:16:10,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586290405] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:16:10,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504404322] [2021-11-05 16:16:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:10,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:16:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:16:10,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:16:10,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-05 16:16:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2426 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 16:16:11,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:16:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:11,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:16:11,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504404322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:11,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:16:11,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-05 16:16:11,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703820026] [2021-11-05 16:16:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:11,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:16:11,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:11,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:16:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:11,365 INFO L87 Difference]: Start difference. First operand 4367 states and 5750 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:13,154 INFO L93 Difference]: Finished difference Result 13066 states and 17208 transitions. [2021-11-05 16:16:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:16:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 137 [2021-11-05 16:16:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:13,172 INFO L225 Difference]: With dead ends: 13066 [2021-11-05 16:16:13,173 INFO L226 Difference]: Without dead ends: 13061 [2021-11-05 16:16:13,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.98ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:13,175 INFO L933 BasicCegarLoop]: 1085 mSDtfsCounter, 975 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 137.51ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:13,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 2150 Invalid, 54 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 137.51ms Time] [2021-11-05 16:16:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13061 states. [2021-11-05 16:16:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13061 to 12859. [2021-11-05 16:16:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12859 states, 12390 states have (on average 1.3170298627925747) internal successors, (16318), 12426 states have internal predecessors, (16318), 288 states have call successors, (288), 180 states have call predecessors, (288), 180 states have return successors, (384), 288 states have call predecessors, (384), 288 states have call successors, (384) [2021-11-05 16:16:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 16990 transitions. [2021-11-05 16:16:14,819 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 16990 transitions. Word has length 137 [2021-11-05 16:16:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:14,819 INFO L470 AbstractCegarLoop]: Abstraction has 12859 states and 16990 transitions. [2021-11-05 16:16:14,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 16990 transitions. [2021-11-05 16:16:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-05 16:16:14,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:14,830 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:14,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-05 16:16:15,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-05 16:16:15,051 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash 221704811, now seen corresponding path program 1 times [2021-11-05 16:16:15,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:15,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370416307] [2021-11-05 16:16:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:15,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:15,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:15,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370416307] [2021-11-05 16:16:15,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370416307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:15,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:15,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:16:15,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321487616] [2021-11-05 16:16:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:15,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:16:15,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:16:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:15,174 INFO L87 Difference]: Start difference. First operand 12859 states and 16990 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:16,887 INFO L93 Difference]: Finished difference Result 25700 states and 33959 transitions. [2021-11-05 16:16:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:16:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 144 [2021-11-05 16:16:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:16,909 INFO L225 Difference]: With dead ends: 25700 [2021-11-05 16:16:16,909 INFO L226 Difference]: Without dead ends: 11206 [2021-11-05 16:16:16,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:16,927 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 417 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.45ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.55ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:16,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 1407 Invalid, 12 Unknown, 0 Unchecked, 1.45ms Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 70.55ms Time] [2021-11-05 16:16:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11206 states. [2021-11-05 16:16:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11206 to 11206. [2021-11-05 16:16:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11206 states, 10815 states have (on average 1.3077207582061952) internal successors, (14143), 10845 states have internal predecessors, (14143), 240 states have call successors, (240), 150 states have call predecessors, (240), 150 states have return successors, (312), 240 states have call predecessors, (312), 240 states have call successors, (312) [2021-11-05 16:16:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11206 states to 11206 states and 14695 transitions. [2021-11-05 16:16:18,395 INFO L78 Accepts]: Start accepts. Automaton has 11206 states and 14695 transitions. Word has length 144 [2021-11-05 16:16:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:18,396 INFO L470 AbstractCegarLoop]: Abstraction has 11206 states and 14695 transitions. [2021-11-05 16:16:18,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 11206 states and 14695 transitions. [2021-11-05 16:16:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-05 16:16:18,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:18,405 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:18,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-05 16:16:18,405 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1828704087, now seen corresponding path program 1 times [2021-11-05 16:16:18,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:18,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280112475] [2021-11-05 16:16:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:18,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:18,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:18,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280112475] [2021-11-05 16:16:18,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280112475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:18,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:18,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:16:18,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818001410] [2021-11-05 16:16:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:18,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:16:18,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:16:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:18,458 INFO L87 Difference]: Start difference. First operand 11206 states and 14695 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:19,325 INFO L93 Difference]: Finished difference Result 16934 states and 22196 transitions. [2021-11-05 16:16:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:16:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 144 [2021-11-05 16:16:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:19,335 INFO L225 Difference]: With dead ends: 16934 [2021-11-05 16:16:19,335 INFO L226 Difference]: Without dead ends: 5740 [2021-11-05 16:16:19,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.20ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:19,346 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.27ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:19,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1109 Invalid, 4 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 83.27ms Time] [2021-11-05 16:16:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5740 states. [2021-11-05 16:16:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5740 to 5740. [2021-11-05 16:16:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 5544 states have (on average 1.306998556998557) internal successors, (7246), 5559 states have internal predecessors, (7246), 120 states have call successors, (120), 75 states have call predecessors, (120), 75 states have return successors, (144), 120 states have call predecessors, (144), 120 states have call successors, (144) [2021-11-05 16:16:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 7510 transitions. [2021-11-05 16:16:20,060 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 7510 transitions. Word has length 144 [2021-11-05 16:16:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:20,061 INFO L470 AbstractCegarLoop]: Abstraction has 5740 states and 7510 transitions. [2021-11-05 16:16:20,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 7510 transitions. [2021-11-05 16:16:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-05 16:16:20,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:20,066 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:20,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-05 16:16:20,067 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1175052160, now seen corresponding path program 1 times [2021-11-05 16:16:20,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:20,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552994384] [2021-11-05 16:16:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:20,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:20,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:20,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552994384] [2021-11-05 16:16:20,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552994384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:20,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:20,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:16:20,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554280585] [2021-11-05 16:16:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:20,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:16:20,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:16:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:20,122 INFO L87 Difference]: Start difference. First operand 5740 states and 7510 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:21,348 INFO L93 Difference]: Finished difference Result 12871 states and 16941 transitions. [2021-11-05 16:16:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:16:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2021-11-05 16:16:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:21,363 INFO L225 Difference]: With dead ends: 12871 [2021-11-05 16:16:21,363 INFO L226 Difference]: Without dead ends: 8167 [2021-11-05 16:16:21,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.19ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:16:21,371 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 489 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.81ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:21,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1221 Invalid, 16 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 100.81ms Time] [2021-11-05 16:16:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2021-11-05 16:16:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8166. [2021-11-05 16:16:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8166 states, 7853 states have (on average 1.317076276582198) internal successors, (10343), 7877 states have internal predecessors, (10343), 192 states have call successors, (192), 120 states have call predecessors, (192), 120 states have return successors, (240), 192 states have call predecessors, (240), 192 states have call successors, (240) [2021-11-05 16:16:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 10775 transitions. [2021-11-05 16:16:22,468 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 10775 transitions. Word has length 149 [2021-11-05 16:16:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:22,468 INFO L470 AbstractCegarLoop]: Abstraction has 8166 states and 10775 transitions. [2021-11-05 16:16:22,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 10775 transitions. [2021-11-05 16:16:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-05 16:16:22,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:22,474 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:22,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-05 16:16:22,474 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1998577788, now seen corresponding path program 1 times [2021-11-05 16:16:22,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:22,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621371261] [2021-11-05 16:16:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:22,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:22,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:22,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621371261] [2021-11-05 16:16:22,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621371261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:22,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:22,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:16:22,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001865426] [2021-11-05 16:16:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:22,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:16:22,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:16:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:22,620 INFO L87 Difference]: Start difference. First operand 8166 states and 10775 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:27,024 INFO L93 Difference]: Finished difference Result 30712 states and 41027 transitions. [2021-11-05 16:16:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 16:16:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2021-11-05 16:16:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:27,072 INFO L225 Difference]: With dead ends: 30712 [2021-11-05 16:16:27,073 INFO L226 Difference]: Without dead ends: 24225 [2021-11-05 16:16:27,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 30.41ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:16:27,093 INFO L933 BasicCegarLoop]: 1327 mSDtfsCounter, 2045 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.58ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.96ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:27,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 4404 Invalid, 131 Unknown, 0 Unchecked, 6.58ms Time], IncrementalHoareTripleChecker [28 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 102.96ms Time] [2021-11-05 16:16:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24225 states. [2021-11-05 16:16:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24225 to 8175. [2021-11-05 16:16:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 7862 states have (on average 1.316713304502671) internal successors, (10352), 7886 states have internal predecessors, (10352), 192 states have call successors, (192), 120 states have call predecessors, (192), 120 states have return successors, (240), 192 states have call predecessors, (240), 192 states have call successors, (240) [2021-11-05 16:16:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 10784 transitions. [2021-11-05 16:16:28,369 INFO L78 Accepts]: Start accepts. Automaton has 8175 states and 10784 transitions. Word has length 149 [2021-11-05 16:16:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:28,369 INFO L470 AbstractCegarLoop]: Abstraction has 8175 states and 10784 transitions. [2021-11-05 16:16:28,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8175 states and 10784 transitions. [2021-11-05 16:16:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-05 16:16:28,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:28,375 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:28,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-05 16:16:28,375 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash 956620576, now seen corresponding path program 1 times [2021-11-05 16:16:28,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:28,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095440209] [2021-11-05 16:16:28,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:28,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:16:28,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:28,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095440209] [2021-11-05 16:16:28,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095440209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:16:28,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:16:28,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:16:28,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040086118] [2021-11-05 16:16:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:16:28,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:16:28,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:16:28,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:16:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:16:28,514 INFO L87 Difference]: Start difference. First operand 8175 states and 10784 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:16:32,128 INFO L93 Difference]: Finished difference Result 26123 states and 34768 transitions. [2021-11-05 16:16:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:16:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 151 [2021-11-05 16:16:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:16:32,163 INFO L225 Difference]: With dead ends: 26123 [2021-11-05 16:16:32,164 INFO L226 Difference]: Without dead ends: 19627 [2021-11-05 16:16:32,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.74ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:16:32,178 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1473 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.61ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.88ms IncrementalHoareTripleChecker+Time [2021-11-05 16:16:32,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 4120 Invalid, 120 Unknown, 0 Unchecked, 5.61ms Time], IncrementalHoareTripleChecker [24 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 94.88ms Time] [2021-11-05 16:16:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19627 states. [2021-11-05 16:16:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19627 to 8184. [2021-11-05 16:16:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8184 states, 7871 states have (on average 1.3163511624952358) internal successors, (10361), 7895 states have internal predecessors, (10361), 192 states have call successors, (192), 120 states have call predecessors, (192), 120 states have return successors, (240), 192 states have call predecessors, (240), 192 states have call successors, (240) [2021-11-05 16:16:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 10793 transitions. [2021-11-05 16:16:33,410 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 10793 transitions. Word has length 151 [2021-11-05 16:16:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:16:33,411 INFO L470 AbstractCegarLoop]: Abstraction has 8184 states and 10793 transitions. [2021-11-05 16:16:33,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:16:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 10793 transitions. [2021-11-05 16:16:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-05 16:16:33,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:16:33,417 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:16:33,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-05 16:16:33,417 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:16:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:16:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1429419044, now seen corresponding path program 1 times [2021-11-05 16:16:33,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:16:33,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435797298] [2021-11-05 16:16:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:33,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:16:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:16:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-05 16:16:33,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:16:33,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435797298] [2021-11-05 16:16:33,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435797298] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:16:33,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831374787] [2021-11-05 16:16:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:16:33,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:16:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:16:33,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:16:33,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-05 16:17:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:17:41,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 105 conjunts are in the unsatisfiable core [2021-11-05 16:17:41,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:17:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2021-11-05 16:17:42,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2021-11-05 16:17:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-05 16:17:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:17:42,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-05 16:17:42,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-11-05 16:17:42,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-05 16:17:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:17:42,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:17:42,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831374787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:17:42,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:17:42,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 29 [2021-11-05 16:17:42,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147133864] [2021-11-05 16:17:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:17:42,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-05 16:17:42,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:17:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-05 16:17:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2021-11-05 16:17:42,460 INFO L87 Difference]: Start difference. First operand 8184 states and 10793 transitions. Second operand has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:17:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:17:58,730 INFO L93 Difference]: Finished difference Result 58003 states and 80531 transitions. [2021-11-05 16:17:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-11-05 16:17:58,730 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-11-05 16:17:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:17:58,814 INFO L225 Difference]: With dead ends: 58003 [2021-11-05 16:17:58,815 INFO L226 Difference]: Without dead ends: 47901 [2021-11-05 16:17:58,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4975 ImplicationChecksByTransitivity, 2829.61ms TimeCoverageRelationStatistics Valid=2808, Invalid=12444, Unknown=0, NotChecked=0, Total=15252 [2021-11-05 16:17:58,846 INFO L933 BasicCegarLoop]: 2290 mSDtfsCounter, 14176 mSDsluCounter, 17036 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3412.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14176 SdHoareTripleChecker+Valid, 19326 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.60ms SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3916.98ms IncrementalHoareTripleChecker+Time [2021-11-05 16:17:58,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14176 Valid, 19326 Invalid, 3904 Unknown, 0 Unchecked, 46.60ms Time], IncrementalHoareTripleChecker [481 Valid, 3423 Invalid, 0 Unknown, 0 Unchecked, 3916.98ms Time] [2021-11-05 16:17:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47901 states. [2021-11-05 16:18:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47901 to 8325. [2021-11-05 16:18:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8325 states, 8012 states have (on average 1.3149026460309536) internal successors, (10535), 8036 states have internal predecessors, (10535), 192 states have call successors, (192), 120 states have call predecessors, (192), 120 states have return successors, (240), 192 states have call predecessors, (240), 192 states have call successors, (240) [2021-11-05 16:18:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10967 transitions. [2021-11-05 16:18:00,494 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10967 transitions. Word has length 153 [2021-11-05 16:18:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:18:00,494 INFO L470 AbstractCegarLoop]: Abstraction has 8325 states and 10967 transitions. [2021-11-05 16:18:00,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:18:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10967 transitions. [2021-11-05 16:18:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-05 16:18:00,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:18:00,507 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:18:00,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-05 16:18:00,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:18:00,720 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:18:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:18:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1527212518, now seen corresponding path program 1 times [2021-11-05 16:18:00,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:18:00,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090817769] [2021-11-05 16:18:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:18:00,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:18:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:18:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:18:01,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:18:01,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090817769] [2021-11-05 16:18:01,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090817769] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:18:01,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815384775] [2021-11-05 16:18:01,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:18:01,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:18:01,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:18:01,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:18:01,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-05 16:25:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:25:43,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 2552 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-05 16:25:43,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:25:44,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:25:44,289 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:25:44,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-11-05 16:25:44,339 INFO L354 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2021-11-05 16:25:44,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2021-11-05 16:25:44,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-05 16:25:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:25:44,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:25:55,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int)) (or (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10))) is different from false [2021-11-05 16:25:57,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) is different from false [2021-11-05 16:25:59,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10))) is different from false [2021-11-05 16:26:01,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) is different from false [2021-11-05 16:26:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:26:01,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815384775] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:26:01,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:26:01,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2021-11-05 16:26:01,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438587516] [2021-11-05 16:26:01,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:26:01,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-05 16:26:01,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:26:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-05 16:26:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=16, NotChecked=188, Total=756 [2021-11-05 16:26:01,822 INFO L87 Difference]: Start difference. First operand 8325 states and 10967 transitions. Second operand has 28 states, 28 states have (on average 8.5) internal successors, (238), 27 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:26:04,957 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_#t~string298.base|) (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))) is different from false [2021-11-05 16:26:07,085 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ 2 c_ULTIMATE.start_ldv_malloc_~p~0.base) |c_#t~string298.base|) (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10)))) is different from false [2021-11-05 16:26:08,859 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ |c_ULTIMATE.start_ldv_malloc_#res.base| 2) |c_#t~string298.base|)) is different from false [2021-11-05 16:26:10,866 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ 2 |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base|) |c_#t~string298.base|) (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 Int)) (or (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_3 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_3) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_6|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_10)))) is different from false [2021-11-05 16:26:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:26:13,220 INFO L93 Difference]: Finished difference Result 15026 states and 19763 transitions. [2021-11-05 16:26:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 16:26:13,222 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.5) internal successors, (238), 27 states have internal predecessors, (238), 0 states have call successors, (0), 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 153 [2021-11-05 16:26:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:26:13,239 INFO L225 Difference]: With dead ends: 15026 [2021-11-05 16:26:13,239 INFO L226 Difference]: Without dead ends: 8380 [2021-11-05 16:26:13,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 24059.22ms TimeCoverageRelationStatistics Valid=101, Invalid=613, Unknown=20, NotChecked=456, Total=1190 [2021-11-05 16:26:13,251 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 12 mSDsluCounter, 7098 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2415.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7606 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.38ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 440 IncrementalHoareTripleChecker+Unchecked, 2644.60ms IncrementalHoareTripleChecker+Time [2021-11-05 16:26:13,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 7606 Invalid, 1161 Unknown, 0 Unchecked, 18.38ms Time], IncrementalHoareTripleChecker [5 Valid, 716 Invalid, 0 Unknown, 440 Unchecked, 2644.60ms Time] [2021-11-05 16:26:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8380 states. [2021-11-05 16:26:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8380 to 8367. [2021-11-05 16:26:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8367 states, 8054 states have (on average 1.3146262726595481) internal successors, (10588), 8078 states have internal predecessors, (10588), 192 states have call successors, (192), 120 states have call predecessors, (192), 120 states have return successors, (240), 192 states have call predecessors, (240), 192 states have call successors, (240) [2021-11-05 16:26:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8367 states to 8367 states and 11020 transitions. [2021-11-05 16:26:14,673 INFO L78 Accepts]: Start accepts. Automaton has 8367 states and 11020 transitions. Word has length 153 [2021-11-05 16:26:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:26:14,673 INFO L470 AbstractCegarLoop]: Abstraction has 8367 states and 11020 transitions. [2021-11-05 16:26:14,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.5) internal successors, (238), 27 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:26:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8367 states and 11020 transitions. [2021-11-05 16:26:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-05 16:26:14,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:26:14,680 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:26:14,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-05 16:26:14,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:26:14,883 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:26:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:26:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 994695716, now seen corresponding path program 1 times [2021-11-05 16:26:14,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:26:14,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895586705] [2021-11-05 16:26:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:26:14,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:26:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:26:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-05 16:26:14,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:26:14,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895586705] [2021-11-05 16:26:14,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895586705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:26:14,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:26:14,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:26:14,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008849213] [2021-11-05 16:26:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:26:14,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:26:14,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:26:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:26:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:26:14,938 INFO L87 Difference]: Start difference. First operand 8367 states and 11020 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:26:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:26:16,734 INFO L93 Difference]: Finished difference Result 19818 states and 26162 transitions. [2021-11-05 16:26:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:26:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 155 [2021-11-05 16:26:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:26:16,800 INFO L225 Difference]: With dead ends: 19818 [2021-11-05 16:26:16,800 INFO L226 Difference]: Without dead ends: 11486 [2021-11-05 16:26:16,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.28ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:26:16,811 INFO L933 BasicCegarLoop]: 720 mSDtfsCounter, 432 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.95ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.93ms IncrementalHoareTripleChecker+Time [2021-11-05 16:26:16,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 1179 Invalid, 38 Unknown, 0 Unchecked, 1.95ms Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 45.93ms Time] [2021-11-05 16:26:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2021-11-05 16:26:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 9611. [2021-11-05 16:26:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9611 states, 9106 states have (on average 1.313858994069844) internal successors, (11964), 9127 states have internal predecessors, (11964), 294 states have call successors, (294), 210 states have call predecessors, (294), 210 states have return successors, (546), 315 states have call predecessors, (546), 294 states have call successors, (546) [2021-11-05 16:26:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9611 states to 9611 states and 12804 transitions. [2021-11-05 16:26:18,147 INFO L78 Accepts]: Start accepts. Automaton has 9611 states and 12804 transitions. Word has length 155 [2021-11-05 16:26:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:26:18,147 INFO L470 AbstractCegarLoop]: Abstraction has 9611 states and 12804 transitions. [2021-11-05 16:26:18,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:26:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 12804 transitions. [2021-11-05 16:26:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-05 16:26:18,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:26:18,150 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:26:18,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-05 16:26:18,151 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:26:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:26:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash -345539873, now seen corresponding path program 2 times [2021-11-05 16:26:18,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:26:18,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811683349] [2021-11-05 16:26:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:26:18,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:26:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:26:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:26:18,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:26:18,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811683349] [2021-11-05 16:26:18,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811683349] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:26:18,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902084295] [2021-11-05 16:26:18,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-05 16:26:18,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:26:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:26:18,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:26:18,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-05 16:27:21,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-05 16:27:21,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-05 16:27:21,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 2560 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-05 16:27:21,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:27:21,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:27:21,703 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:27:21,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-11-05 16:27:21,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:27:21,751 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-11-05 16:27:21,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 40 [2021-11-05 16:27:21,814 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-05 16:27:21,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-05 16:27:21,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-05 16:27:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:27:21,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:27:25,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (< 0 (select (select (store |c_#memory_int| c_ULTIMATE.start_ipheth_probe_~netdev~0.base (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_ipheth_probe_~netdev~0.base) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|)))) is different from false [2021-11-05 16:27:27,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int)) (or (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|)))) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12))) is different from false [2021-11-05 16:27:30,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12))) is different from false [2021-11-05 16:27:32,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))))) is different from false [2021-11-05 16:27:34,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12))) is different from false [2021-11-05 16:27:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:27:34,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902084295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:27:34,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:27:34,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2021-11-05 16:27:34,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528268625] [2021-11-05 16:27:34,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:27:34,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-05 16:27:34,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:27:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-05 16:27:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=680, Unknown=8, NotChecked=280, Total=1056 [2021-11-05 16:27:34,479 INFO L87 Difference]: Start difference. First operand 9611 states and 12804 transitions. Second operand has 33 states, 33 states have (on average 7.393939393939394) internal successors, (244), 32 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:27:38,271 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_#t~string298.base|) (= 104 (select (select |c_#memory_int| |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12)))) is different from false [2021-11-05 16:27:40,287 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (= 104 (select (select |c_#memory_int| |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (<= (+ 2 c_ULTIMATE.start_ldv_malloc_~p~0.base) |c_#t~string298.base|) (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|)))))) is different from false [2021-11-05 16:27:42,294 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12))) (= 104 (select (select |c_#memory_int| |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (<= (+ |c_ULTIMATE.start_ldv_malloc_#res.base| 2) |c_#t~string298.base|)) is different from false [2021-11-05 16:27:44,299 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 Int)) (or (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_5 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12 (store (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_5) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_10|) (+ |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| 1) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_9|)) |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|)))) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_12))) (= |c_#t~string298.offset| 0) (= 104 (select (select |c_#memory_int| |c_#t~string298.base|) (+ 2 |c_#t~string298.offset|))) (<= (+ 2 |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base|) |c_#t~string298.base|)) is different from false [2021-11-05 16:27:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:27:47,474 INFO L93 Difference]: Finished difference Result 19037 states and 25376 transitions. [2021-11-05 16:27:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-05 16:27:47,476 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.393939393939394) internal successors, (244), 32 states have internal predecessors, (244), 0 states have call successors, (0), 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 155 [2021-11-05 16:27:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:27:47,496 INFO L225 Difference]: With dead ends: 19037 [2021-11-05 16:27:47,497 INFO L226 Difference]: Without dead ends: 9626 [2021-11-05 16:27:47,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 20283.92ms TimeCoverageRelationStatistics Valid=132, Invalid=948, Unknown=12, NotChecked=630, Total=1722 [2021-11-05 16:27:47,512 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 8 mSDsluCounter, 9819 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3107.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10327 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.94ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 3383.59ms IncrementalHoareTripleChecker+Time [2021-11-05 16:27:47,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 10327 Invalid, 1563 Unknown, 0 Unchecked, 9.94ms Time], IncrementalHoareTripleChecker [8 Valid, 959 Invalid, 0 Unknown, 596 Unchecked, 3383.59ms Time] [2021-11-05 16:27:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2021-11-05 16:27:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 9613. [2021-11-05 16:27:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9613 states, 9108 states have (on average 1.3137900746596398) internal successors, (11966), 9129 states have internal predecessors, (11966), 294 states have call successors, (294), 210 states have call predecessors, (294), 210 states have return successors, (546), 315 states have call predecessors, (546), 294 states have call successors, (546) [2021-11-05 16:27:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9613 states to 9613 states and 12806 transitions. [2021-11-05 16:27:48,938 INFO L78 Accepts]: Start accepts. Automaton has 9613 states and 12806 transitions. Word has length 155 [2021-11-05 16:27:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:27:48,939 INFO L470 AbstractCegarLoop]: Abstraction has 9613 states and 12806 transitions. [2021-11-05 16:27:48,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.393939393939394) internal successors, (244), 32 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:27:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9613 states and 12806 transitions. [2021-11-05 16:27:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-05 16:27:48,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:27:48,942 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:27:49,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-05 16:27:49,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-05 16:27:49,159 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:27:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:27:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -493923347, now seen corresponding path program 1 times [2021-11-05 16:27:49,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:27:49,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661479885] [2021-11-05 16:27:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:27:49,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:27:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:27:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-05 16:27:49,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:27:49,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661479885] [2021-11-05 16:27:49,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661479885] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:27:49,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464431288] [2021-11-05 16:27:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:27:49,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:27:49,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:27:49,584 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:27:49,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-05 16:28:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:28:03,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 2560 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-05 16:28:03,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:28:04,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:28:04,225 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:28:04,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-11-05 16:28:04,280 INFO L354 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2021-11-05 16:28:04,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2021-11-05 16:28:04,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-05 16:28:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-05 16:28:04,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:28:09,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (< 0 (select (select (store |c_#memory_int| c_ULTIMATE.start_ipheth_probe_~netdev~0.base (store (store (store (select |c_#memory_int| c_ULTIMATE.start_ipheth_probe_~netdev~0.base) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))) is different from false [2021-11-05 16:28:11,894 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int)) (or (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))))) is different from false [2021-11-05 16:28:13,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) is different from false [2021-11-05 16:28:15,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) is different from false [2021-11-05 16:28:17,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14))) is different from false [2021-11-05 16:28:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-05 16:28:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464431288] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:28:18,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:28:18,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2021-11-05 16:28:18,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874618942] [2021-11-05 16:28:18,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:28:18,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-05 16:28:18,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:28:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-05 16:28:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=484, Unknown=12, NotChecked=240, Total=812 [2021-11-05 16:28:18,082 INFO L87 Difference]: Start difference. First operand 9613 states and 12806 transitions. Second operand has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:28:21,153 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14))) (= |c_#t~string298.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_#t~string298.base|) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))) is different from false [2021-11-05 16:28:22,882 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< c_ULTIMATE.start_ldv_malloc_~p~0.base v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) (= |c_#t~string298.offset| 0) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ 2 c_ULTIMATE.start_ldv_malloc_~p~0.base) |c_#t~string298.base|)) is different from false [2021-11-05 16:28:24,581 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))))) (= |c_#t~string298.offset| 0) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ |c_ULTIMATE.start_ldv_malloc_#res.base| 2) |c_#t~string298.base|)) is different from false [2021-11-05 16:28:26,586 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string298.offset| 0) (forall ((v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 Int)) (or (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13| Int) (ULTIMATE.start_ipheth_probe_~netdev~0.offset Int) (v_DerPreprocessor_7 Int)) (< 0 (select (select (store |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14 (store (store (store (select |c_#memory_int| v_ULTIMATE.start_ipheth_probe_~netdev~0.base_14) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 420) v_DerPreprocessor_7) (+ ULTIMATE.start_ipheth_probe_~netdev~0.offset 930) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem420_13|)) |c_#t~string298.base|) (+ |c_#t~string298.offset| 1)))))) (= 116 (select (select |c_#memory_int| |c_#t~string298.base|) (+ |c_#t~string298.offset| 1))) (<= (+ 2 |c_ULTIMATE.start_alloc_etherdev_mqs_#res.base|) |c_#t~string298.base|)) is different from false [2021-11-05 16:28:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:28:29,494 INFO L93 Difference]: Finished difference Result 19074 states and 25422 transitions. [2021-11-05 16:28:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 16:28:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 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 156 [2021-11-05 16:28:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:28:29,516 INFO L225 Difference]: With dead ends: 19074 [2021-11-05 16:28:29,516 INFO L226 Difference]: Without dead ends: 9663 [2021-11-05 16:28:29,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 20512.38ms TimeCoverageRelationStatistics Valid=107, Invalid=615, Unknown=16, NotChecked=522, Total=1260 [2021-11-05 16:28:29,531 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 8 mSDsluCounter, 8419 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2473.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8927 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.99ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 2690.24ms IncrementalHoareTripleChecker+Time [2021-11-05 16:28:29,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 8927 Invalid, 1406 Unknown, 0 Unchecked, 6.99ms Time], IncrementalHoareTripleChecker [7 Valid, 867 Invalid, 0 Unknown, 532 Unchecked, 2690.24ms Time] [2021-11-05 16:28:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9663 states. [2021-11-05 16:28:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9663 to 9648. [2021-11-05 16:28:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9648 states, 9143 states have (on average 1.3135732254183528) internal successors, (12010), 9164 states have internal predecessors, (12010), 294 states have call successors, (294), 210 states have call predecessors, (294), 210 states have return successors, (546), 315 states have call predecessors, (546), 294 states have call successors, (546) [2021-11-05 16:28:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9648 states to 9648 states and 12850 transitions. [2021-11-05 16:28:31,001 INFO L78 Accepts]: Start accepts. Automaton has 9648 states and 12850 transitions. Word has length 156 [2021-11-05 16:28:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:28:31,002 INFO L470 AbstractCegarLoop]: Abstraction has 9648 states and 12850 transitions. [2021-11-05 16:28:31,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 16:28:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9648 states and 12850 transitions. [2021-11-05 16:28:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-05 16:28:31,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:28:31,005 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 16:28:31,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-05 16:28:31,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-05 16:28:31,228 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 16:28:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:28:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1194491031, now seen corresponding path program 1 times [2021-11-05 16:28:31,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:28:31,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420955222] [2021-11-05 16:28:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:28:31,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:28:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:28:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:28:31,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:28:31,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420955222] [2021-11-05 16:28:31,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420955222] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:28:31,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794505005] [2021-11-05 16:28:31,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:28:31,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:28:31,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:28:31,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:28:31,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process Killed by 15