./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.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 b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 01:11:00,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 01:11:00,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 01:11:00,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 01:11:00,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 01:11:00,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 01:11:00,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 01:11:00,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 01:11:00,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 01:11:00,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 01:11:00,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 01:11:00,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 01:11:00,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 01:11:00,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 01:11:00,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 01:11:00,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 01:11:00,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 01:11:00,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 01:11:00,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 01:11:00,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 01:11:00,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 01:11:00,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 01:11:00,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 01:11:00,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 01:11:00,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 01:11:00,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 01:11:00,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 01:11:00,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 01:11:00,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 01:11:00,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 01:11:00,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 01:11:00,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 01:11:00,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 01:11:00,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 01:11:00,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 01:11:00,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 01:11:00,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 01:11:00,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 01:11:00,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 01:11:00,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 01:11:00,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 01:11:00,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 01:11:00,402 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 01:11:00,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 01:11:00,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 01:11:00,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 01:11:00,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 01:11:00,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 01:11:00,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 01:11:00,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 01:11:00,405 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 01:11:00,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 01:11:00,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 01:11:00,407 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 01:11:00,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 01:11:00,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 01:11:00,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 01:11:00,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 01:11:00,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 01:11:00,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 01:11:00,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 01:11:00,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 01:11:00,409 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 -> b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d [2021-11-17 01:11:00,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 01:11:00,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 01:11:00,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 01:11:00,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 01:11:00,631 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 01:11:00,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:11:00,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac64d26/36cf1ae3ac0f4b4e962388934d0d9d81/FLAG3fa2dc78a [2021-11-17 01:11:01,174 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 01:11:01,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:11:01,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac64d26/36cf1ae3ac0f4b4e962388934d0d9d81/FLAG3fa2dc78a [2021-11-17 01:11:01,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac64d26/36cf1ae3ac0f4b4e962388934d0d9d81 [2021-11-17 01:11:01,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 01:11:01,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 01:11:01,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 01:11:01,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 01:11:01,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 01:11:01,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:11:01" (1/1) ... [2021-11-17 01:11:01,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679c88c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:01, skipping insertion in model container [2021-11-17 01:11:01,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:11:01" (1/1) ... [2021-11-17 01:11:01,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 01:11:01,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 01:11:01,836 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-11-17 01:11:01,841 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2021-11-17 01:11:01,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2021-11-17 01:11:02,222 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 01:11:02,249 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 01:11:02,308 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-11-17 01:11:02,310 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2021-11-17 01:11:02,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2021-11-17 01:11:02,399 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 01:11:02,433 INFO L208 MainTranslator]: Completed translation [2021-11-17 01:11:02,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02 WrapperNode [2021-11-17 01:11:02,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 01:11:02,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 01:11:02,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 01:11:02,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 01:11:02,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,562 INFO L137 Inliner]: procedures = 139, calls = 823, calls flagged for inlining = 60, calls inlined = 49, statements flattened = 1703 [2021-11-17 01:11:02,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 01:11:02,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 01:11:02,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 01:11:02,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 01:11:02,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 01:11:02,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 01:11:02,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 01:11:02,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 01:11:02,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (1/1) ... [2021-11-17 01:11:02,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 01:11:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:02,689 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-17 01:11:02,694 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-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 01:11:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 01:11:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_alloc [2021-11-17 01:11:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_alloc [2021-11-17 01:11:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 01:11:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 01:11:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-11-17 01:11:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-11-17 01:11:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 01:11:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 01:11:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_dealloc_kioc [2021-11-17 01:11:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_dealloc_kioc [2021-11-17 01:11:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 01:11:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 01:11:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_attach_buf [2021-11-17 01:11:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_attach_buf [2021-11-17 01:11:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2021-11-17 01:11:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2021-11-17 01:11:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 01:11:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 01:11:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 01:11:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 01:11:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 01:11:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 01:11:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 01:11:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 01:11:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 01:11:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_ioctl [2021-11-17 01:11:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_ioctl [2021-11-17 01:11:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 01:11:02,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 01:11:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 01:11:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 01:11:02,732 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 01:11:02,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 01:11:02,733 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 01:11:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 01:11:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-11-17 01:11:02,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-11-17 01:11:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 01:11:02,734 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 01:11:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure up [2021-11-17 01:11:02,735 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2021-11-17 01:11:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 01:11:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 01:11:02,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 01:11:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-11-17 01:11:02,737 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-11-17 01:11:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 01:11:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 01:11:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 01:11:02,737 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 01:11:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 01:11:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 01:11:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 01:11:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 01:11:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 01:11:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 01:11:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 01:11:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 01:11:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_free [2021-11-17 01:11:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_free [2021-11-17 01:11:03,008 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 01:11:03,010 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 01:11:03,267 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 01:11:04,238 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 01:11:04,244 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 01:11:04,248 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 01:11:04,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:11:04 BoogieIcfgContainer [2021-11-17 01:11:04,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 01:11:04,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 01:11:04,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 01:11:04,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 01:11:04,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:11:01" (1/3) ... [2021-11-17 01:11:04,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5907cc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:11:04, skipping insertion in model container [2021-11-17 01:11:04,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:11:02" (2/3) ... [2021-11-17 01:11:04,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5907cc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:11:04, skipping insertion in model container [2021-11-17 01:11:04,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:11:04" (3/3) ... [2021-11-17 01:11:04,257 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:11:04,260 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 01:11:04,260 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 01:11:04,298 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 01:11:04,302 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-17 01:11:04,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 01:11:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 317 states have (on average 1.4069400630914826) internal successors, (446), 325 states have internal predecessors, (446), 69 states have call successors, (69), 27 states have call predecessors, (69), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:11:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-17 01:11:04,336 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:04,337 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:04,338 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:04,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1306908120, now seen corresponding path program 1 times [2021-11-17 01:11:04,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:04,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470163835] [2021-11-17 01:11:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:04,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 01:11:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 01:11:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 01:11:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 01:11:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 01:11:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 01:11:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 01:11:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 01:11:04,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:04,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470163835] [2021-11-17 01:11:04,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470163835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:04,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:04,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 01:11:04,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691098990] [2021-11-17 01:11:04,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:04,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:11:04,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:11:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:11:04,831 INFO L87 Difference]: Start difference. First operand has 414 states, 317 states have (on average 1.4069400630914826) internal successors, (446), 325 states have internal predecessors, (446), 69 states have call successors, (69), 27 states have call predecessors, (69), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 01:11:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:05,305 INFO L93 Difference]: Finished difference Result 873 states and 1244 transitions. [2021-11-17 01:11:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 01:11:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2021-11-17 01:11:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:05,316 INFO L225 Difference]: With dead ends: 873 [2021-11-17 01:11:05,316 INFO L226 Difference]: Without dead ends: 437 [2021-11-17 01:11:05,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 01:11:05,322 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 208 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:05,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1316 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 01:11:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-17 01:11:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 421. [2021-11-17 01:11:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.3914373088685015) internal successors, (455), 330 states have internal predecessors, (455), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:11:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 588 transitions. [2021-11-17 01:11:05,387 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 588 transitions. Word has length 128 [2021-11-17 01:11:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:05,387 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 588 transitions. [2021-11-17 01:11:05,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 01:11:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 588 transitions. [2021-11-17 01:11:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-17 01:11:05,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:05,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:05,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 01:11:05,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 597728440, now seen corresponding path program 1 times [2021-11-17 01:11:05,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:05,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358286283] [2021-11-17 01:11:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:05,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 01:11:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 01:11:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-17 01:11:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 01:11:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 01:11:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 01:11:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:11:05,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:05,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358286283] [2021-11-17 01:11:05,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358286283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:05,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:05,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 01:11:05,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424437404] [2021-11-17 01:11:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:05,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 01:11:05,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 01:11:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 01:11:05,621 INFO L87 Difference]: Start difference. First operand 421 states and 588 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-17 01:11:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:06,923 INFO L93 Difference]: Finished difference Result 876 states and 1235 transitions. [2021-11-17 01:11:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 01:11:06,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 159 [2021-11-17 01:11:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:06,927 INFO L225 Difference]: With dead ends: 876 [2021-11-17 01:11:06,927 INFO L226 Difference]: Without dead ends: 458 [2021-11-17 01:11:06,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:11:06,929 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 714 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:06,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 977 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 01:11:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-17 01:11:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2021-11-17 01:11:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 330 states have internal predecessors, (447), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:11:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 580 transitions. [2021-11-17 01:11:06,947 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 580 transitions. Word has length 159 [2021-11-17 01:11:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:06,947 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 580 transitions. [2021-11-17 01:11:06,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-17 01:11:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 580 transitions. [2021-11-17 01:11:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 01:11:06,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:06,950 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:06,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 01:11:06,950 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 894777355, now seen corresponding path program 1 times [2021-11-17 01:11:06,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:06,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381835022] [2021-11-17 01:11:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:06,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 01:11:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 01:11:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 01:11:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 01:11:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 01:11:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 01:11:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 01:11:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:11:07,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:07,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381835022] [2021-11-17 01:11:07,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381835022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:07,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:07,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 01:11:07,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740349735] [2021-11-17 01:11:07,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:07,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 01:11:07,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 01:11:07,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 01:11:07,088 INFO L87 Difference]: Start difference. First operand 421 states and 580 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 01:11:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:08,198 INFO L93 Difference]: Finished difference Result 877 states and 1218 transitions. [2021-11-17 01:11:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 01:11:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 163 [2021-11-17 01:11:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:08,201 INFO L225 Difference]: With dead ends: 877 [2021-11-17 01:11:08,201 INFO L226 Difference]: Without dead ends: 458 [2021-11-17 01:11:08,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:08,203 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 244 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:08,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1427 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 01:11:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-17 01:11:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2021-11-17 01:11:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.363914373088685) internal successors, (446), 330 states have internal predecessors, (446), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:11:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 579 transitions. [2021-11-17 01:11:08,218 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 579 transitions. Word has length 163 [2021-11-17 01:11:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:08,219 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 579 transitions. [2021-11-17 01:11:08,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 01:11:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 579 transitions. [2021-11-17 01:11:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-17 01:11:08,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:08,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:08,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 01:11:08,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1727372664, now seen corresponding path program 1 times [2021-11-17 01:11:08,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:08,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267983479] [2021-11-17 01:11:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:08,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 01:11:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 01:11:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-17 01:11:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 01:11:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 01:11:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 01:11:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:11:08,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:08,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267983479] [2021-11-17 01:11:08,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267983479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:08,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:08,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 01:11:08,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193200655] [2021-11-17 01:11:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:08,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 01:11:08,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 01:11:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:11:08,393 INFO L87 Difference]: Start difference. First operand 421 states and 579 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 01:11:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:09,508 INFO L93 Difference]: Finished difference Result 878 states and 1217 transitions. [2021-11-17 01:11:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 01:11:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 159 [2021-11-17 01:11:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:09,511 INFO L225 Difference]: With dead ends: 878 [2021-11-17 01:11:09,511 INFO L226 Difference]: Without dead ends: 456 [2021-11-17 01:11:09,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:09,513 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 247 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:09,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 2272 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 01:11:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-17 01:11:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 419. [2021-11-17 01:11:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 325 states have (on average 1.363076923076923) internal successors, (443), 328 states have internal predecessors, (443), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:11:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 576 transitions. [2021-11-17 01:11:09,538 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 576 transitions. Word has length 159 [2021-11-17 01:11:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:09,538 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 576 transitions. [2021-11-17 01:11:09,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 01:11:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 576 transitions. [2021-11-17 01:11:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 01:11:09,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:09,540 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:09,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 01:11:09,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash 699615025, now seen corresponding path program 1 times [2021-11-17 01:11:09,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:09,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669973136] [2021-11-17 01:11:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:09,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 01:11:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 01:11:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 01:11:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 01:11:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 01:11:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 01:11:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 01:11:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:11:09,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:09,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669973136] [2021-11-17 01:11:09,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669973136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:09,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:09,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 01:11:09,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745728809] [2021-11-17 01:11:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:09,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:11:09,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:11:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:09,687 INFO L87 Difference]: Start difference. First operand 419 states and 576 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-17 01:11:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:11,732 INFO L93 Difference]: Finished difference Result 917 states and 1271 transitions. [2021-11-17 01:11:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 01:11:11,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 163 [2021-11-17 01:11:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:11,735 INFO L225 Difference]: With dead ends: 917 [2021-11-17 01:11:11,736 INFO L226 Difference]: Without dead ends: 501 [2021-11-17 01:11:11,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-17 01:11:11,738 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 405 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:11,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 1710 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-17 01:11:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-17 01:11:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 461. [2021-11-17 01:11:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 363 states have (on average 1.3608815426997245) internal successors, (494), 366 states have internal predecessors, (494), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 629 transitions. [2021-11-17 01:11:11,761 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 629 transitions. Word has length 163 [2021-11-17 01:11:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:11,762 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 629 transitions. [2021-11-17 01:11:11,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-17 01:11:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 629 transitions. [2021-11-17 01:11:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 01:11:11,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:11,764 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:11,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 01:11:11,764 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1621668190, now seen corresponding path program 1 times [2021-11-17 01:11:11,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:11,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640443837] [2021-11-17 01:11:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:11,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 01:11:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 01:11:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 01:11:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 01:11:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 01:11:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 01:11:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 01:11:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 01:11:11,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:11,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640443837] [2021-11-17 01:11:11,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640443837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:11,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:11,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 01:11:11,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669232264] [2021-11-17 01:11:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:11,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:11:11,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:11:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:11,893 INFO L87 Difference]: Start difference. First operand 461 states and 629 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 01:11:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:13,415 INFO L93 Difference]: Finished difference Result 1069 states and 1482 transitions. [2021-11-17 01:11:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 01:11:13,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 181 [2021-11-17 01:11:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:13,419 INFO L225 Difference]: With dead ends: 1069 [2021-11-17 01:11:13,419 INFO L226 Difference]: Without dead ends: 611 [2021-11-17 01:11:13,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-17 01:11:13,421 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 406 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:13,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1900 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 01:11:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-17 01:11:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 462. [2021-11-17 01:11:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 364 states have (on average 1.35989010989011) internal successors, (495), 367 states have internal predecessors, (495), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 630 transitions. [2021-11-17 01:11:13,454 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 630 transitions. Word has length 181 [2021-11-17 01:11:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:13,455 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 630 transitions. [2021-11-17 01:11:13,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 01:11:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 630 transitions. [2021-11-17 01:11:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 01:11:13,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:13,469 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:11:13,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 01:11:13,469 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1433568862, now seen corresponding path program 1 times [2021-11-17 01:11:13,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:13,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113481705] [2021-11-17 01:11:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:13,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 01:11:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 01:11:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 01:11:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 01:11:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 01:11:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 01:11:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 01:11:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-17 01:11:13,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:13,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113481705] [2021-11-17 01:11:13,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113481705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:13,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:13,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 01:11:13,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992507616] [2021-11-17 01:11:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:13,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 01:11:13,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 01:11:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:11:13,643 INFO L87 Difference]: Start difference. First operand 462 states and 630 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 01:11:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:15,010 INFO L93 Difference]: Finished difference Result 962 states and 1325 transitions. [2021-11-17 01:11:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 01:11:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 181 [2021-11-17 01:11:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:15,014 INFO L225 Difference]: With dead ends: 962 [2021-11-17 01:11:15,014 INFO L226 Difference]: Without dead ends: 503 [2021-11-17 01:11:15,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-17 01:11:15,016 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 335 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:15,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 2088 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-17 01:11:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-11-17 01:11:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 464. [2021-11-17 01:11:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 366 states have (on average 1.3579234972677596) internal successors, (497), 369 states have internal predecessors, (497), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 632 transitions. [2021-11-17 01:11:15,037 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 632 transitions. Word has length 181 [2021-11-17 01:11:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:15,038 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 632 transitions. [2021-11-17 01:11:15,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 01:11:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 632 transitions. [2021-11-17 01:11:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-17 01:11:15,040 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:15,040 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-17 01:11:15,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 01:11:15,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 561427367, now seen corresponding path program 1 times [2021-11-17 01:11:15,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:15,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984943614] [2021-11-17 01:11:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:15,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 01:11:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 01:11:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 01:11:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 01:11:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 01:11:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 01:11:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 01:11:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 01:11:15,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:15,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984943614] [2021-11-17 01:11:15,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984943614] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:15,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:15,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 01:11:15,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122998413] [2021-11-17 01:11:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:15,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:11:15,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:11:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:15,246 INFO L87 Difference]: Start difference. First operand 464 states and 632 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:16,968 INFO L93 Difference]: Finished difference Result 963 states and 1325 transitions. [2021-11-17 01:11:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 01:11:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 199 [2021-11-17 01:11:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:16,971 INFO L225 Difference]: With dead ends: 963 [2021-11-17 01:11:16,971 INFO L226 Difference]: Without dead ends: 502 [2021-11-17 01:11:16,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-17 01:11:16,976 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 332 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:16,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 1652 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 01:11:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-17 01:11:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 465. [2021-11-17 01:11:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 367 states have (on average 1.3569482288828338) internal successors, (498), 370 states have internal predecessors, (498), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 633 transitions. [2021-11-17 01:11:16,995 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 633 transitions. Word has length 199 [2021-11-17 01:11:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:16,997 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 633 transitions. [2021-11-17 01:11:16,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 633 transitions. [2021-11-17 01:11:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-17 01:11:16,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:16,999 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-17 01:11:16,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 01:11:16,999 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -575950549, now seen corresponding path program 1 times [2021-11-17 01:11:17,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:17,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321633365] [2021-11-17 01:11:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:17,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 01:11:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 01:11:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 01:11:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 01:11:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 01:11:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 01:11:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 01:11:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 01:11:17,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:17,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321633365] [2021-11-17 01:11:17,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321633365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:17,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:17,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 01:11:17,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597971305] [2021-11-17 01:11:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:17,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:11:17,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:11:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:17,187 INFO L87 Difference]: Start difference. First operand 465 states and 633 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:18,718 INFO L93 Difference]: Finished difference Result 978 states and 1351 transitions. [2021-11-17 01:11:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 01:11:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 199 [2021-11-17 01:11:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:18,730 INFO L225 Difference]: With dead ends: 978 [2021-11-17 01:11:18,730 INFO L226 Difference]: Without dead ends: 516 [2021-11-17 01:11:18,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:18,733 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 349 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:18,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 1678 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 01:11:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-11-17 01:11:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 466. [2021-11-17 01:11:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 368 states have (on average 1.3559782608695652) internal successors, (499), 371 states have internal predecessors, (499), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 634 transitions. [2021-11-17 01:11:18,752 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 634 transitions. Word has length 199 [2021-11-17 01:11:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:18,753 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 634 transitions. [2021-11-17 01:11:18,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 634 transitions. [2021-11-17 01:11:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-17 01:11:18,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:18,755 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2021-11-17 01:11:18,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 01:11:18,756 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1655729045, now seen corresponding path program 1 times [2021-11-17 01:11:18,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:18,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695680562] [2021-11-17 01:11:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:18,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 01:11:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 01:11:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 01:11:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 01:11:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 01:11:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 01:11:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-17 01:11:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-11-17 01:11:18,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:18,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695680562] [2021-11-17 01:11:18,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695680562] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:18,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34574524] [2021-11-17 01:11:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:18,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:18,971 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-17 01:11:19,022 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-17 01:11:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:19,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 1812 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 01:11:19,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 01:11:19,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 01:11:19,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34574524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:19,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 01:11:19,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-17 01:11:19,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42611006] [2021-11-17 01:11:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:19,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:11:19,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:11:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:11:19,725 INFO L87 Difference]: Start difference. First operand 466 states and 634 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:19,745 INFO L93 Difference]: Finished difference Result 937 states and 1284 transitions. [2021-11-17 01:11:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:11:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 207 [2021-11-17 01:11:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:19,748 INFO L225 Difference]: With dead ends: 937 [2021-11-17 01:11:19,748 INFO L226 Difference]: Without dead ends: 474 [2021-11-17 01:11:19,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:11:19,750 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 3 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:19,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1084 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:11:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-17 01:11:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 472. [2021-11-17 01:11:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 374 states have (on average 1.3556149732620322) internal successors, (507), 377 states have internal predecessors, (507), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 642 transitions. [2021-11-17 01:11:19,762 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 642 transitions. Word has length 207 [2021-11-17 01:11:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:19,763 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 642 transitions. [2021-11-17 01:11:19,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:11:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 642 transitions. [2021-11-17 01:11:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-11-17 01:11:19,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:19,765 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:19,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 01:11:19,982 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,SelfDestructingSolverStorable9 [2021-11-17 01:11:19,982 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -216059247, now seen corresponding path program 1 times [2021-11-17 01:11:19,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:19,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091877959] [2021-11-17 01:11:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:19,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 01:11:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 01:11:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 01:11:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 01:11:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 01:11:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 01:11:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 01:11:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-11-17 01:11:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-11-17 01:11:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 01:11:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2021-11-17 01:11:20,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:20,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091877959] [2021-11-17 01:11:20,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091877959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:20,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:20,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 01:11:20,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586891867] [2021-11-17 01:11:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:20,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 01:11:20,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 01:11:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:11:20,256 INFO L87 Difference]: Start difference. First operand 472 states and 642 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 01:11:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:21,921 INFO L93 Difference]: Finished difference Result 975 states and 1337 transitions. [2021-11-17 01:11:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 01:11:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 221 [2021-11-17 01:11:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:21,924 INFO L225 Difference]: With dead ends: 975 [2021-11-17 01:11:21,924 INFO L226 Difference]: Without dead ends: 506 [2021-11-17 01:11:21,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-17 01:11:21,926 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 333 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:21,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 2091 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 01:11:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-17 01:11:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 472. [2021-11-17 01:11:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 374 states have (on average 1.3556149732620322) internal successors, (507), 377 states have internal predecessors, (507), 68 states have call successors, (68), 30 states have call predecessors, (68), 29 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 01:11:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 642 transitions. [2021-11-17 01:11:21,938 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 642 transitions. Word has length 221 [2021-11-17 01:11:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:21,938 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 642 transitions. [2021-11-17 01:11:21,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 01:11:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 642 transitions. [2021-11-17 01:11:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-11-17 01:11:21,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:21,941 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:21,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 01:11:21,941 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1981089616, now seen corresponding path program 1 times [2021-11-17 01:11:21,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:21,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229199020] [2021-11-17 01:11:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:21,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 01:11:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 01:11:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 01:11:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 01:11:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 01:11:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 01:11:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-11-17 01:11:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-11-17 01:11:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-11-17 01:11:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 01:11:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-11-17 01:11:22,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:22,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229199020] [2021-11-17 01:11:22,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229199020] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:22,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242059272] [2021-11-17 01:11:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:22,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:22,130 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-17 01:11:22,188 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-17 01:11:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:22,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 01:11:22,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-17 01:11:22,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:11:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-11-17 01:11:23,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242059272] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:11:23,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 01:11:23,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-11-17 01:11:23,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45628426] [2021-11-17 01:11:23,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 01:11:23,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 01:11:23,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 01:11:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:23,256 INFO L87 Difference]: Start difference. First operand 472 states and 642 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 5 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-17 01:11:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:24,823 INFO L93 Difference]: Finished difference Result 1026 states and 1424 transitions. [2021-11-17 01:11:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 01:11:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 5 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 221 [2021-11-17 01:11:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:24,826 INFO L225 Difference]: With dead ends: 1026 [2021-11-17 01:11:24,826 INFO L226 Difference]: Without dead ends: 557 [2021-11-17 01:11:24,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-11-17 01:11:24,828 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 396 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:24,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 3028 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 01:11:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-11-17 01:11:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 511. [2021-11-17 01:11:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 412 states have internal predecessors, (550), 74 states have call successors, (74), 30 states have call predecessors, (74), 29 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 01:11:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 697 transitions. [2021-11-17 01:11:24,841 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 697 transitions. Word has length 221 [2021-11-17 01:11:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:24,842 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 697 transitions. [2021-11-17 01:11:24,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 5 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-17 01:11:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 697 transitions. [2021-11-17 01:11:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-11-17 01:11:24,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:24,844 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2021-11-17 01:11:24,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-17 01:11:25,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-17 01:11:25,064 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash 530036876, now seen corresponding path program 1 times [2021-11-17 01:11:25,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:25,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212061856] [2021-11-17 01:11:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:25,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 01:11:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 01:11:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 01:11:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 01:11:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 01:11:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 01:11:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-11-17 01:11:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-11-17 01:11:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-17 01:11:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 01:11:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-11-17 01:11:25,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:25,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212061856] [2021-11-17 01:11:25,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212061856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:25,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692157559] [2021-11-17 01:11:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:25,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:25,291 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-17 01:11:25,347 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-17 01:11:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:25,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 01:11:25,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-17 01:11:26,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:11:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-11-17 01:11:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692157559] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:11:26,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 01:11:26,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2021-11-17 01:11:26,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809693810] [2021-11-17 01:11:26,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 01:11:26,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 01:11:26,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 01:11:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-17 01:11:26,433 INFO L87 Difference]: Start difference. First operand 511 states and 697 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-17 01:11:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:28,128 INFO L93 Difference]: Finished difference Result 1084 states and 1504 transitions. [2021-11-17 01:11:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 01:11:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 230 [2021-11-17 01:11:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:28,131 INFO L225 Difference]: With dead ends: 1084 [2021-11-17 01:11:28,131 INFO L226 Difference]: Without dead ends: 576 [2021-11-17 01:11:28,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-11-17 01:11:28,155 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 436 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:28,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 2167 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 01:11:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-17 01:11:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 525. [2021-11-17 01:11:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 419 states have (on average 1.3508353221957041) internal successors, (566), 425 states have internal predecessors, (566), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 717 transitions. [2021-11-17 01:11:28,173 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 717 transitions. Word has length 230 [2021-11-17 01:11:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:28,173 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 717 transitions. [2021-11-17 01:11:28,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-17 01:11:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 717 transitions. [2021-11-17 01:11:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-17 01:11:28,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:28,176 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2021-11-17 01:11:28,197 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-17 01:11:28,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:28,395 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 3784372, now seen corresponding path program 1 times [2021-11-17 01:11:28,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:28,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151318691] [2021-11-17 01:11:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:28,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 01:11:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 01:11:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 01:11:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 01:11:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 01:11:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 01:11:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 01:11:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 01:11:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-17 01:11:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-11-17 01:11:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 01:11:28,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:28,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151318691] [2021-11-17 01:11:28,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151318691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:28,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:11:28,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 01:11:28,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130371094] [2021-11-17 01:11:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:28,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:11:28,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:11:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:11:28,578 INFO L87 Difference]: Start difference. First operand 525 states and 717 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 01:11:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:30,069 INFO L93 Difference]: Finished difference Result 1082 states and 1490 transitions. [2021-11-17 01:11:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 01:11:30,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 238 [2021-11-17 01:11:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:30,072 INFO L225 Difference]: With dead ends: 1082 [2021-11-17 01:11:30,073 INFO L226 Difference]: Without dead ends: 560 [2021-11-17 01:11:30,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:30,074 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 331 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:30,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1661 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 01:11:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-11-17 01:11:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 527. [2021-11-17 01:11:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 421 states have (on average 1.3491686460807601) internal successors, (568), 427 states have internal predecessors, (568), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 719 transitions. [2021-11-17 01:11:30,091 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 719 transitions. Word has length 238 [2021-11-17 01:11:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:30,091 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 719 transitions. [2021-11-17 01:11:30,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 01:11:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 719 transitions. [2021-11-17 01:11:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-11-17 01:11:30,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:30,093 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:30,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 01:11:30,094 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1522985041, now seen corresponding path program 1 times [2021-11-17 01:11:30,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:30,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520989579] [2021-11-17 01:11:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:30,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 01:11:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 01:11:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 01:11:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 01:11:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 01:11:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 01:11:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-11-17 01:11:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 01:11:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 01:11:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-11-17 01:11:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:30,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:30,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520989579] [2021-11-17 01:11:30,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520989579] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:30,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225037480] [2021-11-17 01:11:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:30,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:30,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:30,352 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-17 01:11:30,353 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-17 01:11:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:30,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 1920 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 01:11:30,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-17 01:11:31,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 01:11:31,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225037480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:31,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 01:11:31,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-17 01:11:31,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051749811] [2021-11-17 01:11:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:31,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:11:31,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:11:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:11:31,105 INFO L87 Difference]: Start difference. First operand 527 states and 719 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 01:11:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:31,130 INFO L93 Difference]: Finished difference Result 1054 states and 1442 transitions. [2021-11-17 01:11:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:11:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 239 [2021-11-17 01:11:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:31,133 INFO L225 Difference]: With dead ends: 1054 [2021-11-17 01:11:31,133 INFO L226 Difference]: Without dead ends: 530 [2021-11-17 01:11:31,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:11:31,135 INFO L933 BasicCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:31,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1089 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:11:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-17 01:11:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2021-11-17 01:11:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 422 states have (on average 1.3483412322274881) internal successors, (569), 428 states have internal predecessors, (569), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2021-11-17 01:11:31,149 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 239 [2021-11-17 01:11:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:31,149 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2021-11-17 01:11:31,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 01:11:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2021-11-17 01:11:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-11-17 01:11:31,152 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:31,152 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:31,172 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-17 01:11:31,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 01:11:31,376 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 355617593, now seen corresponding path program 1 times [2021-11-17 01:11:31,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:31,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134570396] [2021-11-17 01:11:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:31,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 01:11:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 01:11:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 01:11:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 01:11:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 01:11:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 01:11:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 01:11:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-11-17 01:11:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 01:11:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 01:11:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 01:11:31,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:31,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134570396] [2021-11-17 01:11:31,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134570396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:31,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268689352] [2021-11-17 01:11:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:31,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:31,606 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-17 01:11:31,635 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-17 01:11:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1926 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-17 01:11:32,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-11-17 01:11:32,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 01:11:32,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268689352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 01:11:32,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 01:11:32,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-11-17 01:11:32,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810257008] [2021-11-17 01:11:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 01:11:32,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:11:32,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:11:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 01:11:32,301 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 01:11:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:32,336 INFO L93 Difference]: Finished difference Result 1057 states and 1445 transitions. [2021-11-17 01:11:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:11:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 240 [2021-11-17 01:11:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:32,339 INFO L225 Difference]: With dead ends: 1057 [2021-11-17 01:11:32,339 INFO L226 Difference]: Without dead ends: 532 [2021-11-17 01:11:32,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:32,341 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 5 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:32,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1627 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:11:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-17 01:11:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2021-11-17 01:11:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 424 states have (on average 1.346698113207547) internal successors, (571), 430 states have internal predecessors, (571), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 722 transitions. [2021-11-17 01:11:32,357 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 722 transitions. Word has length 240 [2021-11-17 01:11:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:32,357 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 722 transitions. [2021-11-17 01:11:32,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 01:11:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 722 transitions. [2021-11-17 01:11:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-17 01:11:32,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:32,360 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:32,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 01:11:32,579 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,SelfDestructingSolverStorable15 [2021-11-17 01:11:32,580 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1853302949, now seen corresponding path program 1 times [2021-11-17 01:11:32,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:32,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143993745] [2021-11-17 01:11:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:32,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 01:11:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 01:11:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 01:11:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 01:11:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 01:11:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 01:11:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 01:11:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 01:11:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-11-17 01:11:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-11-17 01:11:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:32,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:32,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143993745] [2021-11-17 01:11:32,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143993745] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:32,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19783043] [2021-11-17 01:11:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:32,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:32,782 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-17 01:11:32,820 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-17 01:11:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:33,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 01:11:33,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:33,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:11:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:34,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19783043] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:11:34,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 01:11:34,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-11-17 01:11:34,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483778250] [2021-11-17 01:11:34,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 01:11:34,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 01:11:34,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 01:11:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:11:34,146 INFO L87 Difference]: Start difference. First operand 530 states and 722 transitions. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 01:11:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:36,381 INFO L93 Difference]: Finished difference Result 1096 states and 1506 transitions. [2021-11-17 01:11:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 01:11:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 242 [2021-11-17 01:11:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:36,384 INFO L225 Difference]: With dead ends: 1096 [2021-11-17 01:11:36,384 INFO L226 Difference]: Without dead ends: 569 [2021-11-17 01:11:36,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-17 01:11:36,387 INFO L933 BasicCegarLoop]: 511 mSDtfsCounter, 334 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:36,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 2520 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-17 01:11:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-17 01:11:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 536. [2021-11-17 01:11:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 430 states have (on average 1.341860465116279) internal successors, (577), 436 states have internal predecessors, (577), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 728 transitions. [2021-11-17 01:11:36,407 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 728 transitions. Word has length 242 [2021-11-17 01:11:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:36,407 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 728 transitions. [2021-11-17 01:11:36,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 01:11:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 728 transitions. [2021-11-17 01:11:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-11-17 01:11:36,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:36,410 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:36,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-17 01:11:36,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-17 01:11:36,633 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1958183055, now seen corresponding path program 1 times [2021-11-17 01:11:36,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:36,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955272579] [2021-11-17 01:11:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:36,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 01:11:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 01:11:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 01:11:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 01:11:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 01:11:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 01:11:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 01:11:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 01:11:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-11-17 01:11:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-11-17 01:11:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:36,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:36,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955272579] [2021-11-17 01:11:36,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955272579] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:36,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251663414] [2021-11-17 01:11:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:36,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:36,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:36,855 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-17 01:11:36,856 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-17 01:11:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:37,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 01:11:37,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:38,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:11:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-17 01:11:38,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251663414] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:11:38,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 01:11:38,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2021-11-17 01:11:38,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143249693] [2021-11-17 01:11:38,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 01:11:38,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 01:11:38,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:11:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 01:11:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-11-17 01:11:38,447 INFO L87 Difference]: Start difference. First operand 536 states and 728 transitions. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 13 states have internal predecessors, (162), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 01:11:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:11:40,329 INFO L93 Difference]: Finished difference Result 1114 states and 1527 transitions. [2021-11-17 01:11:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 01:11:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 13 states have internal predecessors, (162), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 245 [2021-11-17 01:11:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:11:40,332 INFO L225 Difference]: With dead ends: 1114 [2021-11-17 01:11:40,332 INFO L226 Difference]: Without dead ends: 581 [2021-11-17 01:11:40,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2021-11-17 01:11:40,334 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 340 mSDsluCounter, 3314 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 01:11:40,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 3828 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 01:11:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-17 01:11:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 548. [2021-11-17 01:11:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 442 states have (on average 1.332579185520362) internal successors, (589), 448 states have internal predecessors, (589), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 01:11:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 740 transitions. [2021-11-17 01:11:40,363 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 740 transitions. Word has length 245 [2021-11-17 01:11:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:11:40,363 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 740 transitions. [2021-11-17 01:11:40,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 13 states have internal predecessors, (162), 2 states have call successors, (41), 5 states have call predecessors, (41), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 01:11:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 740 transitions. [2021-11-17 01:11:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-11-17 01:11:40,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:11:40,366 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-17 01:11:40,390 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-17 01:11:40,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:40,580 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:11:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:11:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1439036614, now seen corresponding path program 1 times [2021-11-17 01:11:40,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 01:11:40,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457134195] [2021-11-17 01:11:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:40,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 01:11:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 01:11:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 01:11:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 01:11:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 01:11:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 01:11:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 01:11:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 01:11:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-17 01:11:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 01:11:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 01:11:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 01:11:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 01:11:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 01:11:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-11-17 01:11:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-11-17 01:11:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-17 01:11:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 01:11:40,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 01:11:40,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457134195] [2021-11-17 01:11:40,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457134195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 01:11:40,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026937366] [2021-11-17 01:11:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:11:40,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:11:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:11:40,912 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-17 01:11:40,913 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-17 01:11:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:11:56,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 2001 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-17 01:11:56,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:11:56,590 INFO L354 Elim1Store]: treesize reduction 978, result has 4.5 percent of original size [2021-11-17 01:11:56,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 145 treesize of output 156 [2021-11-17 01:11:59,800 INFO L354 Elim1Store]: treesize reduction 540, result has 14.4 percent of original size [2021-11-17 01:11:59,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 158 treesize of output 225 [2021-11-17 01:12:05,597 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-17 01:12:05,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-17 01:12:05,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-17 01:12:05,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 01:12:05,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-11-17 01:12:05,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006152348] [2021-11-17 01:12:05,601 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 01:12:05,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 01:12:05,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 01:12:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 01:12:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-17 01:12:05,602 INFO L87 Difference]: Start difference. First operand 548 states and 740 transitions. Second operand has 16 states, 16 states have (on average 8.625) internal successors, (138), 13 states have internal predecessors, (138), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 01:12:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 01:12:05,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-17 01:12:05,603 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:05,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:05,632 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-17 01:12:05,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 01:12:05,804 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@125a3f29 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 01:12:05,807 INFO L158 Benchmark]: Toolchain (without parser) took 64354.47ms. Allocated memory was 109.1MB in the beginning and 377.5MB in the end (delta: 268.4MB). Free memory was 66.7MB in the beginning and 183.6MB in the end (delta: -116.8MB). Peak memory consumption was 150.8MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,807 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory was 78.9MB in the beginning and 78.8MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 01:12:05,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 979.86ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 55.5MB in the end (delta: 11.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.37ms. Allocated memory is still 132.1MB. Free memory was 55.5MB in the beginning and 81.4MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,808 INFO L158 Benchmark]: Boogie Preprocessor took 101.18ms. Allocated memory is still 132.1MB. Free memory was 81.4MB in the beginning and 71.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,808 INFO L158 Benchmark]: RCFGBuilder took 1584.89ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 71.8MB in the beginning and 105.8MB in the end (delta: -34.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,808 INFO L158 Benchmark]: TraceAbstraction took 61555.41ms. Allocated memory was 174.1MB in the beginning and 377.5MB in the end (delta: 203.4MB). Free memory was 104.7MB in the beginning and 183.6MB in the end (delta: -78.9MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2021-11-17 01:12:05,809 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory was 78.9MB in the beginning and 78.8MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 979.86ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 55.5MB in the end (delta: 11.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.37ms. Allocated memory is still 132.1MB. Free memory was 55.5MB in the beginning and 81.4MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.18ms. Allocated memory is still 132.1MB. Free memory was 81.4MB in the beginning and 71.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1584.89ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 71.8MB in the beginning and 105.8MB in the end (delta: -34.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61555.41ms. Allocated memory was 174.1MB in the beginning and 377.5MB in the end (delta: 203.4MB). Free memory was 104.7MB in the beginning and 183.6MB in the end (delta: -78.9MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@125a3f29 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@125a3f29: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 01:12:07,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 01:12:07,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 01:12:07,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 01:12:07,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 01:12:07,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 01:12:07,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 01:12:07,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 01:12:07,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 01:12:07,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 01:12:07,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 01:12:07,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 01:12:07,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 01:12:07,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 01:12:07,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 01:12:07,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 01:12:07,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 01:12:07,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 01:12:07,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 01:12:07,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 01:12:07,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 01:12:07,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 01:12:07,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 01:12:07,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 01:12:07,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 01:12:07,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 01:12:07,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 01:12:07,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 01:12:07,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 01:12:07,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 01:12:07,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 01:12:07,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 01:12:07,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 01:12:07,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 01:12:07,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 01:12:07,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 01:12:07,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 01:12:07,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 01:12:07,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 01:12:07,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 01:12:07,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 01:12:07,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 01:12:07,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 01:12:07,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 01:12:07,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 01:12:07,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 01:12:07,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 01:12:07,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 01:12:07,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 01:12:07,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 01:12:07,586 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 01:12:07,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 01:12:07,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 01:12:07,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 01:12:07,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 01:12:07,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 01:12:07,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 01:12:07,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 01:12:07,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 01:12:07,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 01:12:07,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 01:12:07,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 01:12:07,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 01:12:07,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 01:12:07,596 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d [2021-11-17 01:12:07,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 01:12:07,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 01:12:07,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 01:12:07,898 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 01:12:07,899 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 01:12:07,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:12:07,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d8c168b/134d20e46ee64926ab425f855df9bd26/FLAG5651a839b [2021-11-17 01:12:08,496 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 01:12:08,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:12:08,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d8c168b/134d20e46ee64926ab425f855df9bd26/FLAG5651a839b [2021-11-17 01:12:08,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d8c168b/134d20e46ee64926ab425f855df9bd26 [2021-11-17 01:12:08,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 01:12:08,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 01:12:08,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 01:12:08,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 01:12:08,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 01:12:08,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:12:08" (1/1) ... [2021-11-17 01:12:08,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603bf0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:08, skipping insertion in model container [2021-11-17 01:12:08,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:12:08" (1/1) ... [2021-11-17 01:12:08,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 01:12:08,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 01:12:09,155 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-11-17 01:12:09,156 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2021-11-17 01:12:09,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2021-11-17 01:12:09,582 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 01:12:09,619 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 01:12:09,677 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-11-17 01:12:09,678 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2021-11-17 01:12:09,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2021-11-17 01:12:09,825 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 01:12:09,860 INFO L208 MainTranslator]: Completed translation [2021-11-17 01:12:09,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09 WrapperNode [2021-11-17 01:12:09,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 01:12:09,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 01:12:09,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 01:12:09,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 01:12:09,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:09,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:09,998 INFO L137 Inliner]: procedures = 154, calls = 823, calls flagged for inlining = 60, calls inlined = 49, statements flattened = 1660 [2021-11-17 01:12:09,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 01:12:10,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 01:12:10,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 01:12:10,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 01:12:10,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 01:12:10,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 01:12:10,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 01:12:10,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 01:12:10,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (1/1) ... [2021-11-17 01:12:10,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 01:12:10,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 01:12:10,153 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-17 01:12:10,156 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-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 01:12:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 01:12:10,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_alloc [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_alloc [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_dealloc_kioc [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_dealloc_kioc [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_attach_buf [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_attach_buf [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2021-11-17 01:12:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2021-11-17 01:12:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 01:12:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 01:12:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 01:12:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 01:12:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 01:12:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_ioctl [2021-11-17 01:12:10,183 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_ioctl [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 01:12:10,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 01:12:10,183 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 01:12:10,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 01:12:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 01:12:10,184 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 01:12:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-17 01:12:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 01:12:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-17 01:12:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-11-17 01:12:10,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-11-17 01:12:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-17 01:12:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 01:12:10,185 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure up [2021-11-17 01:12:10,186 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 01:12:10,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-11-17 01:12:10,186 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-17 01:12:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 01:12:10,187 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 01:12:10,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 01:12:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 01:12:10,206 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 01:12:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 01:12:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 01:12:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_free [2021-11-17 01:12:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_free [2021-11-17 01:12:10,543 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 01:12:10,545 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 01:12:10,643 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 01:12:19,993 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 01:12:20,016 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 01:12:20,016 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 01:12:20,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:12:20 BoogieIcfgContainer [2021-11-17 01:12:20,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 01:12:20,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 01:12:20,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 01:12:20,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 01:12:20,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:12:08" (1/3) ... [2021-11-17 01:12:20,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e42239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:12:20, skipping insertion in model container [2021-11-17 01:12:20,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:12:09" (2/3) ... [2021-11-17 01:12:20,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e42239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:12:20, skipping insertion in model container [2021-11-17 01:12:20,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:12:20" (3/3) ... [2021-11-17 01:12:20,023 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 01:12:20,026 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 01:12:20,026 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 01:12:20,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 01:12:20,075 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-17 01:12:20,076 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 01:12:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 317 states have (on average 1.4069400630914826) internal successors, (446), 325 states have internal predecessors, (446), 69 states have call successors, (69), 27 states have call predecessors, (69), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:12:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-17 01:12:20,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:20,122 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:20,122 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1708242654, now seen corresponding path program 1 times [2021-11-17 01:12:20,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:20,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380670309] [2021-11-17 01:12:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:20,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:20,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:20,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-17 01:12:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:20,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-17 01:12:20,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 01:12:21,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 01:12:21,631 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:21,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380670309] [2021-11-17 01:12:21,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380670309] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:21,632 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:21,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-17 01:12:21,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326450445] [2021-11-17 01:12:21,634 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:21,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-17 01:12:21,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-17 01:12:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 01:12:21,677 INFO L87 Difference]: Start difference. First operand has 414 states, 317 states have (on average 1.4069400630914826) internal successors, (446), 325 states have internal predecessors, (446), 69 states have call successors, (69), 27 states have call predecessors, (69), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 01:12:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:21,724 INFO L93 Difference]: Finished difference Result 823 states and 1170 transitions. [2021-11-17 01:12:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 01:12:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2021-11-17 01:12:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:21,734 INFO L225 Difference]: With dead ends: 823 [2021-11-17 01:12:21,734 INFO L226 Difference]: Without dead ends: 398 [2021-11-17 01:12:21,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 01:12:21,741 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:21,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-17 01:12:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-11-17 01:12:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 306 states have (on average 1.3888888888888888) internal successors, (425), 309 states have internal predecessors, (425), 66 states have call successors, (66), 26 states have call predecessors, (66), 25 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 01:12:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 556 transitions. [2021-11-17 01:12:21,787 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 556 transitions. Word has length 128 [2021-11-17 01:12:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:21,787 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 556 transitions. [2021-11-17 01:12:21,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 01:12:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2021-11-17 01:12:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-17 01:12:21,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:21,792 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:21,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-17 01:12:22,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:22,020 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1349293573, now seen corresponding path program 1 times [2021-11-17 01:12:22,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:22,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476730065] [2021-11-17 01:12:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:22,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:22,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:22,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-17 01:12:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:22,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:22,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 01:12:23,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 01:12:23,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:23,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476730065] [2021-11-17 01:12:23,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476730065] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:23,321 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:23,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 01:12:23,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726616351] [2021-11-17 01:12:23,321 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:23,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:12:23,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:12:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:23,323 INFO L87 Difference]: Start difference. First operand 398 states and 556 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 01:12:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:23,445 INFO L93 Difference]: Finished difference Result 819 states and 1146 transitions. [2021-11-17 01:12:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:12:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2021-11-17 01:12:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:23,448 INFO L225 Difference]: With dead ends: 819 [2021-11-17 01:12:23,448 INFO L226 Difference]: Without dead ends: 424 [2021-11-17 01:12:23,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:23,451 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 32 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:23,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 1091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 01:12:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-11-17 01:12:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2021-11-17 01:12:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.3914373088685015) internal successors, (455), 330 states have internal predecessors, (455), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:12:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 588 transitions. [2021-11-17 01:12:23,485 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 588 transitions. Word has length 129 [2021-11-17 01:12:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:23,486 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 588 transitions. [2021-11-17 01:12:23,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 01:12:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 588 transitions. [2021-11-17 01:12:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 01:12:23,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:23,488 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:23,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:23,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:23,711 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -506105006, now seen corresponding path program 1 times [2021-11-17 01:12:23,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:23,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37019748] [2021-11-17 01:12:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:23,713 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:23,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:23,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-17 01:12:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:24,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:24,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:24,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:25,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:25,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37019748] [2021-11-17 01:12:25,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37019748] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:25,203 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:25,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2021-11-17 01:12:25,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794183085] [2021-11-17 01:12:25,203 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:25,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:12:25,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:12:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:25,204 INFO L87 Difference]: Start difference. First operand 421 states and 588 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 01:12:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:25,256 INFO L93 Difference]: Finished difference Result 839 states and 1175 transitions. [2021-11-17 01:12:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:12:25,256 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), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2021-11-17 01:12:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:25,258 INFO L225 Difference]: With dead ends: 839 [2021-11-17 01:12:25,258 INFO L226 Difference]: Without dead ends: 421 [2021-11-17 01:12:25,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:25,261 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 539 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:25,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 542 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-11-17 01:12:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-11-17 01:12:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 330 states have internal predecessors, (447), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:12:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 580 transitions. [2021-11-17 01:12:25,276 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 580 transitions. Word has length 163 [2021-11-17 01:12:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:25,277 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 580 transitions. [2021-11-17 01:12:25,277 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), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 01:12:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 580 transitions. [2021-11-17 01:12:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 01:12:25,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:25,279 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:25,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:25,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:25,500 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash 899086672, now seen corresponding path program 1 times [2021-11-17 01:12:25,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:25,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850525404] [2021-11-17 01:12:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:25,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:25,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:25,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:25,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-17 01:12:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:26,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 01:12:26,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:26,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:26,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:26,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850525404] [2021-11-17 01:12:26,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850525404] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:26,930 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:26,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-17 01:12:26,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750173765] [2021-11-17 01:12:26,930 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:26,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 01:12:26,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 01:12:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:12:26,931 INFO L87 Difference]: Start difference. First operand 421 states and 580 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:28,971 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 01:12:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:29,136 INFO L93 Difference]: Finished difference Result 843 states and 1162 transitions. [2021-11-17 01:12:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 01:12:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 163 [2021-11-17 01:12:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:29,148 INFO L225 Difference]: With dead ends: 843 [2021-11-17 01:12:29,148 INFO L226 Difference]: Without dead ends: 419 [2021-11-17 01:12:29,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:12:29,150 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 9 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:29,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 3265 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-11-17 01:12:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-11-17 01:12:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-11-17 01:12:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 325 states have (on average 1.363076923076923) internal successors, (443), 328 states have internal predecessors, (443), 67 states have call successors, (67), 27 states have call predecessors, (67), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 01:12:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 576 transitions. [2021-11-17 01:12:29,176 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 576 transitions. Word has length 163 [2021-11-17 01:12:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:29,179 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 576 transitions. [2021-11-17 01:12:29,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 576 transitions. [2021-11-17 01:12:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 01:12:29,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:29,183 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:29,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-17 01:12:29,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:29,395 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2078366486, now seen corresponding path program 1 times [2021-11-17 01:12:29,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:29,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024628291] [2021-11-17 01:12:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:29,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:29,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:29,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-17 01:12:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:29,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:29,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:30,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-17 01:12:31,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:31,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024628291] [2021-11-17 01:12:31,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024628291] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:31,059 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:31,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 01:12:31,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706468493] [2021-11-17 01:12:31,059 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:31,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:12:31,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:12:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:31,061 INFO L87 Difference]: Start difference. First operand 419 states and 576 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 01:12:33,099 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 01:12:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:33,300 INFO L93 Difference]: Finished difference Result 918 states and 1268 transitions. [2021-11-17 01:12:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:12:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 163 [2021-11-17 01:12:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:33,304 INFO L225 Difference]: With dead ends: 918 [2021-11-17 01:12:33,304 INFO L226 Difference]: Without dead ends: 502 [2021-11-17 01:12:33,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:33,308 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 105 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:33,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 1571 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-17 01:12:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-17 01:12:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 496. [2021-11-17 01:12:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 396 states have (on average 1.3686868686868687) internal successors, (542), 399 states have internal predecessors, (542), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 679 transitions. [2021-11-17 01:12:33,340 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 679 transitions. Word has length 163 [2021-11-17 01:12:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:33,341 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 679 transitions. [2021-11-17 01:12:33,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 01:12:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 679 transitions. [2021-11-17 01:12:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 01:12:33,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:33,345 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:33,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:33,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:33,568 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -588749119, now seen corresponding path program 1 times [2021-11-17 01:12:33,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:33,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047047153] [2021-11-17 01:12:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:33,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:33,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:33,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-17 01:12:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:34,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:34,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 01:12:34,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 01:12:35,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:35,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047047153] [2021-11-17 01:12:35,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047047153] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:35,104 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:35,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 01:12:35,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601882839] [2021-11-17 01:12:35,104 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:35,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:12:35,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:12:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:35,105 INFO L87 Difference]: Start difference. First operand 496 states and 679 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:35,144 INFO L93 Difference]: Finished difference Result 1134 states and 1566 transitions. [2021-11-17 01:12:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:12:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 181 [2021-11-17 01:12:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:35,148 INFO L225 Difference]: With dead ends: 1134 [2021-11-17 01:12:35,149 INFO L226 Difference]: Without dead ends: 641 [2021-11-17 01:12:35,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:35,154 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 74 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:35,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-11-17 01:12:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 497. [2021-11-17 01:12:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 397 states have (on average 1.3677581863979849) internal successors, (543), 400 states have internal predecessors, (543), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 680 transitions. [2021-11-17 01:12:35,181 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 680 transitions. Word has length 181 [2021-11-17 01:12:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:35,183 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 680 transitions. [2021-11-17 01:12:35,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 680 transitions. [2021-11-17 01:12:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-17 01:12:35,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:35,186 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 01:12:35,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:35,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:35,401 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1649606768, now seen corresponding path program 1 times [2021-11-17 01:12:35,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:35,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82275255] [2021-11-17 01:12:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:35,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:35,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:35,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:35,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-17 01:12:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:36,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:36,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:36,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:36,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:36,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82275255] [2021-11-17 01:12:36,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82275255] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:36,939 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:36,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 01:12:36,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22369504] [2021-11-17 01:12:36,940 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:36,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:12:36,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:12:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:36,940 INFO L87 Difference]: Start difference. First operand 497 states and 680 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:36,983 INFO L93 Difference]: Finished difference Result 995 states and 1365 transitions. [2021-11-17 01:12:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:12:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 177 [2021-11-17 01:12:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:36,987 INFO L225 Difference]: With dead ends: 995 [2021-11-17 01:12:36,987 INFO L226 Difference]: Without dead ends: 501 [2021-11-17 01:12:36,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:36,990 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:36,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1628 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-17 01:12:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2021-11-17 01:12:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 401 states have (on average 1.3640897755610972) internal successors, (547), 404 states have internal predecessors, (547), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 684 transitions. [2021-11-17 01:12:37,023 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 684 transitions. Word has length 177 [2021-11-17 01:12:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:37,023 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 684 transitions. [2021-11-17 01:12:37,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 684 transitions. [2021-11-17 01:12:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 01:12:37,026 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:37,026 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:37,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:37,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:37,249 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1528177176, now seen corresponding path program 1 times [2021-11-17 01:12:37,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:37,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067049611] [2021-11-17 01:12:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:37,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:37,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:37,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:37,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-17 01:12:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:37,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 01:12:37,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:38,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:38,885 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:38,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067049611] [2021-11-17 01:12:38,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067049611] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:12:38,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 01:12:38,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-17 01:12:38,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161648847] [2021-11-17 01:12:38,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 01:12:38,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 01:12:38,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 01:12:38,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:12:38,887 INFO L87 Difference]: Start difference. First operand 501 states and 684 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:39,083 INFO L93 Difference]: Finished difference Result 1007 states and 1379 transitions. [2021-11-17 01:12:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 01:12:39,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 181 [2021-11-17 01:12:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:39,086 INFO L225 Difference]: With dead ends: 1007 [2021-11-17 01:12:39,086 INFO L226 Difference]: Without dead ends: 509 [2021-11-17 01:12:39,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-17 01:12:39,088 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:39,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2719 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 01:12:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-11-17 01:12:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2021-11-17 01:12:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 412 states have internal predecessors, (555), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 692 transitions. [2021-11-17 01:12:39,101 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 692 transitions. Word has length 181 [2021-11-17 01:12:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:39,101 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 692 transitions. [2021-11-17 01:12:39,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 692 transitions. [2021-11-17 01:12:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-17 01:12:39,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:39,104 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:39,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:39,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:39,326 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 811039397, now seen corresponding path program 1 times [2021-11-17 01:12:39,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:39,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817150516] [2021-11-17 01:12:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:39,327 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:39,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:39,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:39,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-17 01:12:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:39,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 01:12:39,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-17 01:12:40,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-17 01:12:41,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:41,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817150516] [2021-11-17 01:12:41,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817150516] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:12:41,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 01:12:41,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-17 01:12:41,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870589408] [2021-11-17 01:12:41,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 01:12:41,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 01:12:41,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 01:12:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-17 01:12:41,365 INFO L87 Difference]: Start difference. First operand 509 states and 692 transitions. Second operand has 16 states, 16 states have (on average 9.375) internal successors, (150), 16 states have internal predecessors, (150), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:42,168 INFO L93 Difference]: Finished difference Result 1031 states and 1407 transitions. [2021-11-17 01:12:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 01:12:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.375) internal successors, (150), 16 states have internal predecessors, (150), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2021-11-17 01:12:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:42,171 INFO L225 Difference]: With dead ends: 1031 [2021-11-17 01:12:42,171 INFO L226 Difference]: Without dead ends: 525 [2021-11-17 01:12:42,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-17 01:12:42,173 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 3836 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:42,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4386 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 01:12:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-11-17 01:12:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2021-11-17 01:12:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 425 states have (on average 1.3435294117647059) internal successors, (571), 428 states have internal predecessors, (571), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 708 transitions. [2021-11-17 01:12:42,194 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 708 transitions. Word has length 193 [2021-11-17 01:12:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:42,194 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 708 transitions. [2021-11-17 01:12:42,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.375) internal successors, (150), 16 states have internal predecessors, (150), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 708 transitions. [2021-11-17 01:12:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-11-17 01:12:42,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:42,196 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:42,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:42,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:42,411 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash -936760404, now seen corresponding path program 2 times [2021-11-17 01:12:42,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:42,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252249915] [2021-11-17 01:12:42,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 01:12:42,413 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:42,414 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:42,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-17 01:12:42,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 01:12:42,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 01:12:42,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:42,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2021-11-17 01:12:43,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2021-11-17 01:12:43,478 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:43,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252249915] [2021-11-17 01:12:43,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252249915] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:43,478 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:43,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 01:12:43,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115783823] [2021-11-17 01:12:43,478 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:43,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:12:43,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:43,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:12:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:43,479 INFO L87 Difference]: Start difference. First operand 525 states and 708 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:12:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:43,518 INFO L93 Difference]: Finished difference Result 1048 states and 1417 transitions. [2021-11-17 01:12:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:12:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 205 [2021-11-17 01:12:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:43,522 INFO L225 Difference]: With dead ends: 1048 [2021-11-17 01:12:43,522 INFO L226 Difference]: Without dead ends: 526 [2021-11-17 01:12:43,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:43,524 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:43,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1083 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-11-17 01:12:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2021-11-17 01:12:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 426 states have (on average 1.3427230046948357) internal successors, (572), 429 states have internal predecessors, (572), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 709 transitions. [2021-11-17 01:12:43,536 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 709 transitions. Word has length 205 [2021-11-17 01:12:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:43,537 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 709 transitions. [2021-11-17 01:12:43,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:12:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 709 transitions. [2021-11-17 01:12:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-11-17 01:12:43,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:43,539 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:43,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:43,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:43,756 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1669263150, now seen corresponding path program 1 times [2021-11-17 01:12:43,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:43,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846561520] [2021-11-17 01:12:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:43,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:43,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:43,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:43,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-17 01:12:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:44,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-17 01:12:44,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:45,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 01:12:46,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:46,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846561520] [2021-11-17 01:12:46,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846561520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:12:46,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 01:12:46,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-17 01:12:46,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479274915] [2021-11-17 01:12:46,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 01:12:46,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-17 01:12:46,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-17 01:12:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-17 01:12:46,988 INFO L87 Difference]: Start difference. First operand 526 states and 709 transitions. Second operand has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:48,194 INFO L93 Difference]: Finished difference Result 1051 states and 1420 transitions. [2021-11-17 01:12:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 01:12:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2021-11-17 01:12:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:48,197 INFO L225 Difference]: With dead ends: 1051 [2021-11-17 01:12:48,197 INFO L226 Difference]: Without dead ends: 528 [2021-11-17 01:12:48,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-17 01:12:48,199 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 9968 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10526 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:48,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10526 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 01:12:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-17 01:12:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-11-17 01:12:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 428 states have (on average 1.341121495327103) internal successors, (574), 431 states have internal predecessors, (574), 69 states have call successors, (69), 31 states have call predecessors, (69), 30 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2021-11-17 01:12:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 711 transitions. [2021-11-17 01:12:48,211 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 711 transitions. Word has length 205 [2021-11-17 01:12:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:48,212 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 711 transitions. [2021-11-17 01:12:48,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 711 transitions. [2021-11-17 01:12:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-17 01:12:48,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:48,214 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:48,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:48,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:48,433 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -402356279, now seen corresponding path program 2 times [2021-11-17 01:12:48,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:48,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313818392] [2021-11-17 01:12:48,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 01:12:48,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:48,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:48,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-17 01:12:48,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 01:12:48,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 01:12:48,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:48,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-11-17 01:12:49,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-11-17 01:12:49,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:49,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313818392] [2021-11-17 01:12:49,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313818392] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:49,373 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:49,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 01:12:49,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856081313] [2021-11-17 01:12:49,373 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:49,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 01:12:49,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 01:12:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:49,374 INFO L87 Difference]: Start difference. First operand 528 states and 711 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:12:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:50,392 INFO L93 Difference]: Finished difference Result 1069 states and 1452 transitions. [2021-11-17 01:12:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:12:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 207 [2021-11-17 01:12:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:50,396 INFO L225 Difference]: With dead ends: 1069 [2021-11-17 01:12:50,396 INFO L226 Difference]: Without dead ends: 544 [2021-11-17 01:12:50,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 01:12:50,398 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 28 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:50,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1096 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-17 01:12:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-11-17 01:12:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2021-11-17 01:12:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 436 states have (on average 1.341743119266055) internal successors, (585), 440 states have internal predecessors, (585), 71 states have call successors, (71), 31 states have call predecessors, (71), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2021-11-17 01:12:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 726 transitions. [2021-11-17 01:12:50,422 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 726 transitions. Word has length 207 [2021-11-17 01:12:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:50,422 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 726 transitions. [2021-11-17 01:12:50,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 01:12:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 726 transitions. [2021-11-17 01:12:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-17 01:12:50,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:50,425 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:50,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:50,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:50,641 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1276392076, now seen corresponding path program 1 times [2021-11-17 01:12:50,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:50,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616928917] [2021-11-17 01:12:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:50,642 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:50,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:50,643 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-17 01:12:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:51,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:12:51,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-17 01:12:51,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-11-17 01:12:52,107 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:52,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616928917] [2021-11-17 01:12:52,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616928917] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:52,107 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:52,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 01:12:52,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863088151] [2021-11-17 01:12:52,107 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:52,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:12:52,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:52,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:12:52,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:52,108 INFO L87 Difference]: Start difference. First operand 538 states and 726 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:52,141 INFO L93 Difference]: Finished difference Result 1076 states and 1456 transitions. [2021-11-17 01:12:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:12:52,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 219 [2021-11-17 01:12:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:52,145 INFO L225 Difference]: With dead ends: 1076 [2021-11-17 01:12:52,145 INFO L226 Difference]: Without dead ends: 541 [2021-11-17 01:12:52,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 434 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:12:52,147 INFO L933 BasicCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:52,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1089 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-11-17 01:12:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2021-11-17 01:12:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 437 states have (on average 1.3409610983981692) internal successors, (586), 441 states have internal predecessors, (586), 71 states have call successors, (71), 31 states have call predecessors, (71), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2021-11-17 01:12:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 727 transitions. [2021-11-17 01:12:52,160 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 727 transitions. Word has length 219 [2021-11-17 01:12:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:52,161 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 727 transitions. [2021-11-17 01:12:52,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 727 transitions. [2021-11-17 01:12:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-17 01:12:52,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:52,164 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 01:12:52,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:52,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:52,387 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1480799412, now seen corresponding path program 1 times [2021-11-17 01:12:52,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:52,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648717724] [2021-11-17 01:12:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:52,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:52,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:52,390 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:52,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-17 01:12:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:53,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 01:12:53,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-17 01:12:53,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-11-17 01:12:53,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:53,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648717724] [2021-11-17 01:12:53,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648717724] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:53,931 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:53,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 01:12:53,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265904518] [2021-11-17 01:12:53,931 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:53,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:12:53,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:12:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:12:53,932 INFO L87 Difference]: Start difference. First operand 539 states and 727 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:54,089 INFO L93 Difference]: Finished difference Result 1077 states and 1456 transitions. [2021-11-17 01:12:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:12:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 219 [2021-11-17 01:12:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:54,094 INFO L225 Difference]: With dead ends: 1077 [2021-11-17 01:12:54,094 INFO L226 Difference]: Without dead ends: 541 [2021-11-17 01:12:54,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:12:54,096 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 395 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:54,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1813 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 01:12:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-11-17 01:12:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2021-11-17 01:12:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 437 states have (on average 1.3363844393592677) internal successors, (584), 441 states have internal predecessors, (584), 71 states have call successors, (71), 31 states have call predecessors, (71), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2021-11-17 01:12:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 725 transitions. [2021-11-17 01:12:54,113 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 725 transitions. Word has length 219 [2021-11-17 01:12:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:54,114 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 725 transitions. [2021-11-17 01:12:54,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 725 transitions. [2021-11-17 01:12:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-17 01:12:54,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:54,117 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2021-11-17 01:12:54,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:54,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:54,340 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 124635978, now seen corresponding path program 1 times [2021-11-17 01:12:54,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:54,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824673524] [2021-11-17 01:12:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:54,342 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:54,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:54,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:54,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-17 01:12:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:55,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 01:12:55,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-17 01:12:55,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2021-11-17 01:12:56,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:56,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824673524] [2021-11-17 01:12:56,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824673524] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:56,035 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:56,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 01:12:56,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568190781] [2021-11-17 01:12:56,035 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:56,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:12:56,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:12:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:12:56,036 INFO L87 Difference]: Start difference. First operand 539 states and 725 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:56,113 INFO L93 Difference]: Finished difference Result 1079 states and 1455 transitions. [2021-11-17 01:12:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 01:12:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 237 [2021-11-17 01:12:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:56,140 INFO L225 Difference]: With dead ends: 1079 [2021-11-17 01:12:56,140 INFO L226 Difference]: Without dead ends: 543 [2021-11-17 01:12:56,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:12:56,142 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 4 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:56,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1625 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:12:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-17 01:12:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2021-11-17 01:12:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.3348519362186788) internal successors, (586), 443 states have internal predecessors, (586), 71 states have call successors, (71), 31 states have call predecessors, (71), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2021-11-17 01:12:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 727 transitions. [2021-11-17 01:12:56,154 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 727 transitions. Word has length 237 [2021-11-17 01:12:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:56,154 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 727 transitions. [2021-11-17 01:12:56,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 01:12:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 727 transitions. [2021-11-17 01:12:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-17 01:12:56,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:56,157 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1] [2021-11-17 01:12:56,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-17 01:12:56,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:56,376 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2116616354, now seen corresponding path program 1 times [2021-11-17 01:12:56,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:56,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766183612] [2021-11-17 01:12:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:56,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:56,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:56,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-17 01:12:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:57,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 01:12:57,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-11-17 01:12:57,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:12:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-11-17 01:12:57,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:12:57,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766183612] [2021-11-17 01:12:57,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766183612] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:12:57,992 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:12:57,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 01:12:57,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443138525] [2021-11-17 01:12:57,992 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:12:57,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 01:12:57,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:12:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 01:12:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 01:12:57,994 INFO L87 Difference]: Start difference. First operand 541 states and 727 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:12:58,150 INFO L93 Difference]: Finished difference Result 1085 states and 1462 transitions. [2021-11-17 01:12:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 01:12:58,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 242 [2021-11-17 01:12:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:12:58,157 INFO L225 Difference]: With dead ends: 1085 [2021-11-17 01:12:58,157 INFO L226 Difference]: Without dead ends: 547 [2021-11-17 01:12:58,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 01:12:58,159 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 9 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 01:12:58,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 2165 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 01:12:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-17 01:12:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2021-11-17 01:12:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 441 states have (on average 1.3333333333333333) internal successors, (588), 445 states have internal predecessors, (588), 71 states have call successors, (71), 31 states have call predecessors, (71), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2021-11-17 01:12:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 729 transitions. [2021-11-17 01:12:58,171 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 729 transitions. Word has length 242 [2021-11-17 01:12:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:12:58,172 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 729 transitions. [2021-11-17 01:12:58,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 01:12:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 729 transitions. [2021-11-17 01:12:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-11-17 01:12:58,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:12:58,174 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2021-11-17 01:12:58,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-17 01:12:58,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:12:58,398 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:12:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:12:58,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1783783483, now seen corresponding path program 1 times [2021-11-17 01:12:58,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:12:58,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210312501] [2021-11-17 01:12:58,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:12:58,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:12:58,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:12:58,402 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:12:58,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-17 01:12:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:12:59,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 01:12:59,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:12:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2021-11-17 01:12:59,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:13:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-11-17 01:13:00,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:13:00,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210312501] [2021-11-17 01:13:00,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210312501] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 01:13:00,094 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 01:13:00,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-17 01:13:00,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551010805] [2021-11-17 01:13:00,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 01:13:00,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 01:13:00,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:13:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 01:13:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 01:13:00,097 INFO L87 Difference]: Start difference. First operand 543 states and 729 transitions. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 01:13:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:13:05,395 INFO L93 Difference]: Finished difference Result 1128 states and 1537 transitions. [2021-11-17 01:13:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 01:13:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 241 [2021-11-17 01:13:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:13:05,420 INFO L225 Difference]: With dead ends: 1128 [2021-11-17 01:13:05,420 INFO L226 Difference]: Without dead ends: 588 [2021-11-17 01:13:05,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-17 01:13:05,426 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 60 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-11-17 01:13:05,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 3896 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2021-11-17 01:13:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-11-17 01:13:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 570. [2021-11-17 01:13:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 469 states have internal predecessors, (618), 77 states have call successors, (77), 31 states have call predecessors, (77), 30 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2021-11-17 01:13:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 771 transitions. [2021-11-17 01:13:05,466 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 771 transitions. Word has length 241 [2021-11-17 01:13:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:13:05,468 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 771 transitions. [2021-11-17 01:13:05,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 01:13:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 771 transitions. [2021-11-17 01:13:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-17 01:13:05,470 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:13:05,470 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 01:13:05,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-17 01:13:05,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:13:05,706 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:13:05,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:13:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2091486352, now seen corresponding path program 2 times [2021-11-17 01:13:05,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:13:05,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892714211] [2021-11-17 01:13:05,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 01:13:05,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:13:05,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:13:05,710 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:13:05,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-17 01:13:06,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 01:13:06,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 01:13:06,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 01:13:06,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:13:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-11-17 01:13:06,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 01:13:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2021-11-17 01:13:07,017 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:13:07,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892714211] [2021-11-17 01:13:07,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892714211] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 01:13:07,017 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 01:13:07,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 01:13:07,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206060534] [2021-11-17 01:13:07,021 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 01:13:07,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 01:13:07,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 01:13:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 01:13:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:13:07,022 INFO L87 Difference]: Start difference. First operand 570 states and 771 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 01:13:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 01:13:07,081 INFO L93 Difference]: Finished difference Result 1162 states and 1581 transitions. [2021-11-17 01:13:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 01:13:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 253 [2021-11-17 01:13:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 01:13:07,090 INFO L225 Difference]: With dead ends: 1162 [2021-11-17 01:13:07,090 INFO L226 Difference]: Without dead ends: 595 [2021-11-17 01:13:07,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 01:13:07,092 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 3 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 01:13:07,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1082 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 01:13:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-11-17 01:13:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2021-11-17 01:13:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 485 states have (on average 1.3298969072164948) internal successors, (645), 491 states have internal predecessors, (645), 77 states have call successors, (77), 31 states have call predecessors, (77), 30 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2021-11-17 01:13:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 798 transitions. [2021-11-17 01:13:07,108 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 798 transitions. Word has length 253 [2021-11-17 01:13:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 01:13:07,111 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 798 transitions. [2021-11-17 01:13:07,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 01:13:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 798 transitions. [2021-11-17 01:13:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-17 01:13:07,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 01:13:07,114 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-17 01:13:07,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-17 01:13:07,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 01:13:07,330 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 01:13:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 01:13:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1927372185, now seen corresponding path program 1 times [2021-11-17 01:13:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 01:13:07,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999467923] [2021-11-17 01:13:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:13:07,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 01:13:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 01:13:07,333 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 01:13:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-17 01:13:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 01:13:13,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-17 01:13:13,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 01:13:14,923 INFO L354 Elim1Store]: treesize reduction 1148, result has 6.2 percent of original size [2021-11-17 01:13:14,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 235 treesize of output 268 [2021-11-17 01:13:14,958 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 01:13:14,958 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 248 treesize of output 196 [2021-11-17 01:13:14,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-17 01:13:14,995 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 01:13:14,996 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 193 treesize of output 183 [2021-11-17 01:13:34,530 INFO L354 Elim1Store]: treesize reduction 502, result has 19.4 percent of original size [2021-11-17 01:13:34,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 64 case distinctions, treesize of input 202 treesize of output 299 [2021-11-17 01:13:43,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-17 01:13:43,483 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-17 01:13:43,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 01:13:43,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999467923] [2021-11-17 01:13:43,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-17 01:13:43,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2142098803] [2021-11-17 01:13:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 01:13:43,484 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-17 01:13:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-17 01:13:43,486 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-17 01:13:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process Killed by 15