./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 00:25:18,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:25:18,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:25:18,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:25:18,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:25:18,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:25:18,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:25:18,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:25:18,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:25:18,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:25:18,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:25:18,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:25:18,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:25:18,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:25:18,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:25:18,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:25:18,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:25:18,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:25:18,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:25:18,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:25:18,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:25:18,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:25:18,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:25:18,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:25:18,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:25:18,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:25:18,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:25:18,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:25:18,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:25:18,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:25:18,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:25:18,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:25:18,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:25:18,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:25:18,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:25:18,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:25:18,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:25:18,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:25:18,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:25:18,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:25:18,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:25:18,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:25:18,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:25:18,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:25:18,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:25:18,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:25:18,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:25:18,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:25:18,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:25:18,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:25:18,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:25:18,222 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:25:18,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:25:18,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:25:18,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:25:18,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:25:18,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:25:18,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:25:18,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:25:18,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:25:18,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:25:18,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:25:18,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:25:18,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:25:18,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:25:18,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:25:18,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:25:18,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:25:18,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:25:18,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:25:18,227 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:25:18,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:25:18,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:25:18,227 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-07-23 00:25:18,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:25:18,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:25:18,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:25:18,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:25:18,476 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:25:18,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:18,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a794f12a9/03fe9705f5124259ac09f8c224d54af1/FLAG7f63e8d97 [2022-07-23 00:25:19,097 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:25:19,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:19,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a794f12a9/03fe9705f5124259ac09f8c224d54af1/FLAG7f63e8d97 [2022-07-23 00:25:19,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a794f12a9/03fe9705f5124259ac09f8c224d54af1 [2022-07-23 00:25:19,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:25:19,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:25:19,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:25:19,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:25:19,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:25:19,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:25:19" (1/1) ... [2022-07-23 00:25:19,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559a2eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:19, skipping insertion in model container [2022-07-23 00:25:19,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:25:19" (1/1) ... [2022-07-23 00:25:19,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:25:19,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:25:20,149 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-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-23 00:25:20,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:25:20,188 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:25:20,375 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-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-23 00:25:20,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:25:20,412 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:25:20,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20 WrapperNode [2022-07-23 00:25:20,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:25:20,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:25:20,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:25:20,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:25:20,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,485 INFO L137 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 781 [2022-07-23 00:25:20,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:25:20,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:25:20,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:25:20,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:25:20,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:25:20,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:25:20,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:25:20,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:25:20,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (1/1) ... [2022-07-23 00:25:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:25:20,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:20,622 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) [2022-07-23 00:25:20,647 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 [2022-07-23 00:25:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:25:20,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:25:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:25:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 00:25:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 00:25:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:25:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:25:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 00:25:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 00:25:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-23 00:25:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-23 00:25:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:25:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:25:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:25:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 00:25:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 00:25:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-23 00:25:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-23 00:25:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 00:25:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 00:25:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:25:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:25:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:25:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:25:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 00:25:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 00:25:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 00:25:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-23 00:25:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-23 00:25:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-23 00:25:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-23 00:25:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-23 00:25:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-23 00:25:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:25:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:25:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:25:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 00:25:20,674 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 00:25:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 00:25:20,674 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 00:25:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:25:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:25:20,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:25:21,001 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:25:21,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:25:21,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:25:21,638 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:25:21,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:25:21,653 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:25:21,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:25:21 BoogieIcfgContainer [2022-07-23 00:25:21,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:25:21,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:25:21,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:25:21,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:25:21,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:25:19" (1/3) ... [2022-07-23 00:25:21,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532c8f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:25:21, skipping insertion in model container [2022-07-23 00:25:21,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:20" (2/3) ... [2022-07-23 00:25:21,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532c8f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:25:21, skipping insertion in model container [2022-07-23 00:25:21,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:25:21" (3/3) ... [2022-07-23 00:25:21,664 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:21,676 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:25:21,676 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:25:21,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:25:21,745 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58bf24ca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42b09355 [2022-07-23 00:25:21,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:25:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-23 00:25:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 00:25:21,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:21,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:21,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash -949146533, now seen corresponding path program 1 times [2022-07-23 00:25:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:21,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247720535] [2022-07-23 00:25:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 00:25:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:22,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247720535] [2022-07-23 00:25:22,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247720535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:22,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:22,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:25:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297057819] [2022-07-23 00:25:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:25:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:25:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:25:22,226 INFO L87 Difference]: Start difference. First operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:22,555 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-07-23 00:25:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:25:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-23 00:25:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:22,572 INFO L225 Difference]: With dead ends: 476 [2022-07-23 00:25:22,572 INFO L226 Difference]: Without dead ends: 233 [2022-07-23 00:25:22,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:25:22,590 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 90 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:22,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 468 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-23 00:25:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-07-23 00:25:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 172 states have (on average 1.2848837209302326) internal successors, (221), 177 states have internal predecessors, (221), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-23 00:25:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 295 transitions. [2022-07-23 00:25:22,662 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 295 transitions. Word has length 32 [2022-07-23 00:25:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:22,663 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 295 transitions. [2022-07-23 00:25:22,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 295 transitions. [2022-07-23 00:25:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 00:25:22,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:22,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:22,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:25:22,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash -526444707, now seen corresponding path program 1 times [2022-07-23 00:25:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:22,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979342815] [2022-07-23 00:25:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 00:25:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:22,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979342815] [2022-07-23 00:25:22,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979342815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:22,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:22,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787542632] [2022-07-23 00:25:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:22,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:22,832 INFO L87 Difference]: Start difference. First operand 226 states and 295 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:23,299 INFO L93 Difference]: Finished difference Result 658 states and 868 transitions. [2022-07-23 00:25:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:25:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-23 00:25:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:23,304 INFO L225 Difference]: With dead ends: 658 [2022-07-23 00:25:23,304 INFO L226 Difference]: Without dead ends: 437 [2022-07-23 00:25:23,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:23,310 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 394 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:23,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 674 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:25:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-23 00:25:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2022-07-23 00:25:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 322 states have (on average 1.279503105590062) internal successors, (412), 329 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-23 00:25:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-07-23 00:25:23,369 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 32 [2022-07-23 00:25:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:23,370 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-07-23 00:25:23,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-07-23 00:25:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 00:25:23,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:23,373 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:25:23,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1956153286, now seen corresponding path program 1 times [2022-07-23 00:25:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:23,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960995701] [2022-07-23 00:25:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:23,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960995701] [2022-07-23 00:25:23,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960995701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:23,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:23,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:25:23,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076513172] [2022-07-23 00:25:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:25:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:25:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:23,492 INFO L87 Difference]: Start difference. First operand 423 states and 552 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 00:25:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:24,156 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-07-23 00:25:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:25:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-23 00:25:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:24,162 INFO L225 Difference]: With dead ends: 1000 [2022-07-23 00:25:24,163 INFO L226 Difference]: Without dead ends: 592 [2022-07-23 00:25:24,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:24,165 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 626 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:24,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 00:25:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-23 00:25:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2022-07-23 00:25:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 325 states have (on average 1.2738461538461539) internal successors, (414), 332 states have internal predecessors, (414), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-23 00:25:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2022-07-23 00:25:24,225 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 55 [2022-07-23 00:25:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:24,228 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2022-07-23 00:25:24,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 00:25:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2022-07-23 00:25:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 00:25:24,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:24,234 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:24,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:25:24,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1601497338, now seen corresponding path program 1 times [2022-07-23 00:25:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278224733] [2022-07-23 00:25:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278224733] [2022-07-23 00:25:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278224733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:24,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017386610] [2022-07-23 00:25:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:24,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:24,353 INFO L87 Difference]: Start difference. First operand 426 states and 554 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:24,765 INFO L93 Difference]: Finished difference Result 1269 states and 1671 transitions. [2022-07-23 00:25:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:25:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-07-23 00:25:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:24,770 INFO L225 Difference]: With dead ends: 1269 [2022-07-23 00:25:24,771 INFO L226 Difference]: Without dead ends: 858 [2022-07-23 00:25:24,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:24,773 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 391 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:24,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 779 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:25:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-07-23 00:25:24,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 828. [2022-07-23 00:25:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 636 states have (on average 1.2688679245283019) internal successors, (807), 647 states have internal predecessors, (807), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1077 transitions. [2022-07-23 00:25:24,848 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1077 transitions. Word has length 55 [2022-07-23 00:25:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:24,848 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1077 transitions. [2022-07-23 00:25:24,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1077 transitions. [2022-07-23 00:25:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 00:25:24,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:24,855 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:24,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:25:24,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1893200283, now seen corresponding path program 1 times [2022-07-23 00:25:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159014421] [2022-07-23 00:25:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159014421] [2022-07-23 00:25:24,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159014421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:24,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:24,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525486762] [2022-07-23 00:25:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:24,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:24,959 INFO L87 Difference]: Start difference. First operand 828 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:25,245 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2022-07-23 00:25:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-23 00:25:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:25,250 INFO L225 Difference]: With dead ends: 858 [2022-07-23 00:25:25,250 INFO L226 Difference]: Without dead ends: 855 [2022-07-23 00:25:25,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:25,251 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 279 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:25,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 599 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-07-23 00:25:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 827. [2022-07-23 00:25:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 636 states have (on average 1.2672955974842768) internal successors, (806), 646 states have internal predecessors, (806), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1075 transitions. [2022-07-23 00:25:25,286 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1075 transitions. Word has length 56 [2022-07-23 00:25:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:25,287 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1075 transitions. [2022-07-23 00:25:25,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1075 transitions. [2022-07-23 00:25:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 00:25:25,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:25,289 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:25,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:25:25,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1440318295, now seen corresponding path program 1 times [2022-07-23 00:25:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:25,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506731941] [2022-07-23 00:25:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506731941] [2022-07-23 00:25:25,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506731941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:25,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:25,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078482200] [2022-07-23 00:25:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:25,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:25,395 INFO L87 Difference]: Start difference. First operand 827 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:25,685 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2022-07-23 00:25:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-23 00:25:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:25,690 INFO L225 Difference]: With dead ends: 857 [2022-07-23 00:25:25,690 INFO L226 Difference]: Without dead ends: 854 [2022-07-23 00:25:25,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:25,691 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 276 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:25,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 595 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 00:25:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-23 00:25:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2022-07-23 00:25:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 636 states have (on average 1.2657232704402517) internal successors, (805), 645 states have internal predecessors, (805), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1073 transitions. [2022-07-23 00:25:25,730 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1073 transitions. Word has length 57 [2022-07-23 00:25:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:25,731 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1073 transitions. [2022-07-23 00:25:25,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1073 transitions. [2022-07-23 00:25:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 00:25:25,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:25,732 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:25,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:25:25,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1700174242, now seen corresponding path program 1 times [2022-07-23 00:25:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:25,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919763345] [2022-07-23 00:25:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919763345] [2022-07-23 00:25:25,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919763345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:25,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:25,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440629209] [2022-07-23 00:25:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:25,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:25,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:25,852 INFO L87 Difference]: Start difference. First operand 826 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:26,187 INFO L93 Difference]: Finished difference Result 856 states and 1122 transitions. [2022-07-23 00:25:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-23 00:25:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:26,192 INFO L225 Difference]: With dead ends: 856 [2022-07-23 00:25:26,192 INFO L226 Difference]: Without dead ends: 845 [2022-07-23 00:25:26,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:26,195 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 273 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:26,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 594 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 00:25:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-23 00:25:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 817. [2022-07-23 00:25:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 628 states have (on average 1.2643312101910829) internal successors, (794), 636 states have internal predecessors, (794), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1061 transitions. [2022-07-23 00:25:26,229 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1061 transitions. Word has length 58 [2022-07-23 00:25:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:26,229 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1061 transitions. [2022-07-23 00:25:26,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1061 transitions. [2022-07-23 00:25:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-23 00:25:26,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:26,237 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:26,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 00:25:26,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1841089283, now seen corresponding path program 1 times [2022-07-23 00:25:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:26,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855242897] [2022-07-23 00:25:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 00:25:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 00:25:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 00:25:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:25:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 00:25:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 00:25:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 00:25:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 00:25:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 00:25:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-23 00:25:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:26,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855242897] [2022-07-23 00:25:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855242897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:26,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:26,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:25:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178978152] [2022-07-23 00:25:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:25:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:26,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:25:26,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:26,419 INFO L87 Difference]: Start difference. First operand 817 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:26,853 INFO L93 Difference]: Finished difference Result 1711 states and 2241 transitions. [2022-07-23 00:25:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2022-07-23 00:25:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:26,859 INFO L225 Difference]: With dead ends: 1711 [2022-07-23 00:25:26,859 INFO L226 Difference]: Without dead ends: 909 [2022-07-23 00:25:26,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:25:26,866 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 90 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1119 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:25:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-07-23 00:25:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2022-07-23 00:25:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 681 states have (on average 1.2745961820851688) internal successors, (868), 689 states have internal predecessors, (868), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1135 transitions. [2022-07-23 00:25:26,911 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1135 transitions. Word has length 153 [2022-07-23 00:25:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:26,912 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1135 transitions. [2022-07-23 00:25:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1135 transitions. [2022-07-23 00:25:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 00:25:26,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:26,915 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 00:25:26,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash 314942574, now seen corresponding path program 1 times [2022-07-23 00:25:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:26,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503744112] [2022-07-23 00:25:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:25:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 00:25:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-23 00:25:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 00:25:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:25:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:25:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 00:25:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:25:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:27,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503744112] [2022-07-23 00:25:27,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503744112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:27,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:27,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 00:25:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509290882] [2022-07-23 00:25:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:27,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 00:25:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 00:25:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:27,103 INFO L87 Difference]: Start difference. First operand 871 states and 1135 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:27,576 INFO L93 Difference]: Finished difference Result 2321 states and 3120 transitions. [2022-07-23 00:25:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-07-23 00:25:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:27,584 INFO L225 Difference]: With dead ends: 2321 [2022-07-23 00:25:27,584 INFO L226 Difference]: Without dead ends: 1469 [2022-07-23 00:25:27,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:27,588 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 450 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:27,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1833 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:25:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-23 00:25:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 883. [2022-07-23 00:25:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 693 states have (on average 1.2698412698412698) internal successors, (880), 701 states have internal predecessors, (880), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-23 00:25:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1147 transitions. [2022-07-23 00:25:27,631 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1147 transitions. Word has length 162 [2022-07-23 00:25:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:27,632 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1147 transitions. [2022-07-23 00:25:27,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1147 transitions. [2022-07-23 00:25:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-23 00:25:27,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:27,636 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:27,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 00:25:27,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1067823865, now seen corresponding path program 1 times [2022-07-23 00:25:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:27,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103633835] [2022-07-23 00:25:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:27,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 00:25:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:25:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:25:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 00:25:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:27,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:27,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103633835] [2022-07-23 00:25:27,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103633835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767039349] [2022-07-23 00:25:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:27,839 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) [2022-07-23 00:25:27,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 00:25:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:25:28,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:28,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:28,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767039349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:28,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:28,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-23 00:25:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604118187] [2022-07-23 00:25:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:28,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:28,313 INFO L87 Difference]: Start difference. First operand 883 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:28,512 INFO L93 Difference]: Finished difference Result 2857 states and 3742 transitions. [2022-07-23 00:25:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-23 00:25:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:28,522 INFO L225 Difference]: With dead ends: 2857 [2022-07-23 00:25:28,522 INFO L226 Difference]: Without dead ends: 1993 [2022-07-23 00:25:28,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-23 00:25:28,525 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 401 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:28,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1915 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:25:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-23 00:25:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 919. [2022-07-23 00:25:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 721 states have (on average 1.259361997226075) internal successors, (908), 729 states have internal predecessors, (908), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-07-23 00:25:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1191 transitions. [2022-07-23 00:25:28,599 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1191 transitions. Word has length 164 [2022-07-23 00:25:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:28,600 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1191 transitions. [2022-07-23 00:25:28,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1191 transitions. [2022-07-23 00:25:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-23 00:25:28,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:28,603 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:28,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-23 00:25:28,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2078941115, now seen corresponding path program 1 times [2022-07-23 00:25:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119233865] [2022-07-23 00:25:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 00:25:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:25:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:25:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 00:25:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 00:25:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119233865] [2022-07-23 00:25:29,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119233865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197276381] [2022-07-23 00:25:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:29,070 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) [2022-07-23 00:25:29,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 00:25:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:29,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 00:25:29,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-23 00:25:29,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:29,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197276381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:29,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:29,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-07-23 00:25:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289722998] [2022-07-23 00:25:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:29,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:25:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:25:29,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:25:29,577 INFO L87 Difference]: Start difference. First operand 919 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:29,730 INFO L93 Difference]: Finished difference Result 2201 states and 2930 transitions. [2022-07-23 00:25:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:25:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-23 00:25:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:29,738 INFO L225 Difference]: With dead ends: 2201 [2022-07-23 00:25:29,738 INFO L226 Difference]: Without dead ends: 1301 [2022-07-23 00:25:29,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-23 00:25:29,741 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 97 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:29,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1903 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:25:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-23 00:25:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 939. [2022-07-23 00:25:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2537313432835822) internal successors, (924), 745 states have internal predecessors, (924), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-23 00:25:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1227 transitions. [2022-07-23 00:25:29,849 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1227 transitions. Word has length 164 [2022-07-23 00:25:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:29,849 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1227 transitions. [2022-07-23 00:25:29,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 00:25:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1227 transitions. [2022-07-23 00:25:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-23 00:25:29,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:29,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:29,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:30,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 00:25:30,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1954792649, now seen corresponding path program 1 times [2022-07-23 00:25:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:30,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890771832] [2022-07-23 00:25:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 00:25:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:25:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:25:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 00:25:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:25:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 00:25:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:30,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890771832] [2022-07-23 00:25:30,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890771832] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:30,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113018433] [2022-07-23 00:25:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:30,282 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) [2022-07-23 00:25:30,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 00:25:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:30,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 00:25:30,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-23 00:25:30,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113018433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:30,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-23 00:25:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093800483] [2022-07-23 00:25:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:30,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:30,671 INFO L87 Difference]: Start difference. First operand 939 states and 1227 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:30,802 INFO L93 Difference]: Finished difference Result 1879 states and 2467 transitions. [2022-07-23 00:25:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:25:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2022-07-23 00:25:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:30,807 INFO L225 Difference]: With dead ends: 1879 [2022-07-23 00:25:30,807 INFO L226 Difference]: Without dead ends: 959 [2022-07-23 00:25:30,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:25:30,811 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 1 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:30,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:25:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-23 00:25:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2022-07-23 00:25:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 745 states have (on average 1.251006711409396) internal successors, (932), 749 states have internal predecessors, (932), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-23 00:25:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1235 transitions. [2022-07-23 00:25:30,885 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1235 transitions. Word has length 170 [2022-07-23 00:25:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:30,885 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1235 transitions. [2022-07-23 00:25:30,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1235 transitions. [2022-07-23 00:25:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-23 00:25:30,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:30,889 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:30,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:31,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:31,112 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -794500219, now seen corresponding path program 2 times [2022-07-23 00:25:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637198278] [2022-07-23 00:25:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:25:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:25:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:25:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:25:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 00:25:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 00:25:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-23 00:25:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637198278] [2022-07-23 00:25:31,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637198278] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439837731] [2022-07-23 00:25:31,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:25:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:31,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:31,517 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) [2022-07-23 00:25:31,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 00:25:31,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 00:25:31,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:25:31,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 00:25:31,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-23 00:25:31,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:31,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439837731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:31,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:31,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-23 00:25:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497109325] [2022-07-23 00:25:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:31,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:25:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:25:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-23 00:25:31,920 INFO L87 Difference]: Start difference. First operand 947 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:32,245 INFO L93 Difference]: Finished difference Result 1933 states and 2603 transitions. [2022-07-23 00:25:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:25:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 176 [2022-07-23 00:25:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:32,252 INFO L225 Difference]: With dead ends: 1933 [2022-07-23 00:25:32,252 INFO L226 Difference]: Without dead ends: 1465 [2022-07-23 00:25:32,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-23 00:25:32,255 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 611 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:32,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1863 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:25:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-07-23 00:25:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 953. [2022-07-23 00:25:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 751 states have (on average 1.2490013315579227) internal successors, (938), 755 states have internal predecessors, (938), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-23 00:25:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1241 transitions. [2022-07-23 00:25:32,332 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1241 transitions. Word has length 176 [2022-07-23 00:25:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:32,332 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1241 transitions. [2022-07-23 00:25:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1241 transitions. [2022-07-23 00:25:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-23 00:25:32,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:32,336 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:32,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:32,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:32,562 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1273770335, now seen corresponding path program 1 times [2022-07-23 00:25:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:32,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8895775] [2022-07-23 00:25:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:25:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:25:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:25:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:25:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:25:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 00:25:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 00:25:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 00:25:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-23 00:25:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8895775] [2022-07-23 00:25:32,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8895775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925091066] [2022-07-23 00:25:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:32,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:32,865 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) [2022-07-23 00:25:32,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 00:25:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 00:25:33,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-23 00:25:33,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925091066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:33,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-23 00:25:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236820487] [2022-07-23 00:25:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:33,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:25:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:25:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:33,518 INFO L87 Difference]: Start difference. First operand 953 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:25:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:33,839 INFO L93 Difference]: Finished difference Result 2823 states and 3686 transitions. [2022-07-23 00:25:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:25:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 207 [2022-07-23 00:25:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:33,851 INFO L225 Difference]: With dead ends: 2823 [2022-07-23 00:25:33,851 INFO L226 Difference]: Without dead ends: 2815 [2022-07-23 00:25:33,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:33,853 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 410 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:33,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1103 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:25:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-07-23 00:25:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2801. [2022-07-23 00:25:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2211 states have (on average 1.252826775214835) internal successors, (2770), 2227 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-23 00:25:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3665 transitions. [2022-07-23 00:25:34,083 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3665 transitions. Word has length 207 [2022-07-23 00:25:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:34,084 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 3665 transitions. [2022-07-23 00:25:34,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:25:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3665 transitions. [2022-07-23 00:25:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-23 00:25:34,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:34,090 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:34,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:34,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-23 00:25:34,304 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash 262653085, now seen corresponding path program 1 times [2022-07-23 00:25:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008925190] [2022-07-23 00:25:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:25:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:25:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:25:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:25:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:25:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 00:25:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 00:25:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 00:25:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-23 00:25:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:34,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008925190] [2022-07-23 00:25:34,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008925190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:34,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:34,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 00:25:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36002687] [2022-07-23 00:25:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:34,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 00:25:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 00:25:34,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:25:34,540 INFO L87 Difference]: Start difference. First operand 2801 states and 3665 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-23 00:25:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:35,727 INFO L93 Difference]: Finished difference Result 8991 states and 11824 transitions. [2022-07-23 00:25:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 00:25:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 207 [2022-07-23 00:25:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:35,755 INFO L225 Difference]: With dead ends: 8991 [2022-07-23 00:25:35,756 INFO L226 Difference]: Without dead ends: 6209 [2022-07-23 00:25:35,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-23 00:25:35,767 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 472 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:35,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1553 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 00:25:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2022-07-23 00:25:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 2813. [2022-07-23 00:25:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2223 states have (on average 1.2514619883040936) internal successors, (2782), 2243 states have internal predecessors, (2782), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-23 00:25:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3677 transitions. [2022-07-23 00:25:36,096 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3677 transitions. Word has length 207 [2022-07-23 00:25:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:36,099 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3677 transitions. [2022-07-23 00:25:36,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-23 00:25:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3677 transitions. [2022-07-23 00:25:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-23 00:25:36,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:36,106 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:36,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 00:25:36,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1700386181, now seen corresponding path program 1 times [2022-07-23 00:25:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:36,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871856814] [2022-07-23 00:25:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:25:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:25:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:25:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:25:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:25:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:25:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:25:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 00:25:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 00:25:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 00:25:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 00:25:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-23 00:25:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:36,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871856814] [2022-07-23 00:25:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871856814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566584027] [2022-07-23 00:25:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:36,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:36,595 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) [2022-07-23 00:25:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 00:25:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-23 00:25:37,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:37,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:25:37,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-23 00:25:37,531 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1026 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1026) |c_#memory_int|)) is different from true [2022-07-23 00:25:37,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:25:37,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:25:37,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:25:37,613 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 00:25:37,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 00:26:50,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:02,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:02,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:15,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:15,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:15,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:27:15,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-07-23 00:27:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-07-23 00:27:15,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:27:15,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1035 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-07-23 00:27:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566584027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:27:15,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:27:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-07-23 00:27:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394641303] [2022-07-23 00:27:15,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:27:15,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 00:27:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 00:27:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1426, Unknown=9, NotChecked=154, Total=1722 [2022-07-23 00:27:15,135 INFO L87 Difference]: Start difference. First operand 2813 states and 3677 transitions. Second operand has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-23 00:28:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:37,274 INFO L93 Difference]: Finished difference Result 7649 states and 10194 transitions. [2022-07-23 00:28:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 00:28:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 214 [2022-07-23 00:28:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:37,295 INFO L225 Difference]: With dead ends: 7649 [2022-07-23 00:28:37,295 INFO L226 Difference]: Without dead ends: 4855 [2022-07-23 00:28:37,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 275 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 177.9s TimeCoverageRelationStatistics Valid=322, Invalid=3798, Unknown=48, NotChecked=254, Total=4422 [2022-07-23 00:28:37,303 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 661 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1378 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:37,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 8119 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1595 Invalid, 0 Unknown, 1378 Unchecked, 1.1s Time] [2022-07-23 00:28:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2022-07-23 00:28:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3317. [2022-07-23 00:28:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 2652 states have (on average 1.254524886877828) internal successors, (3327), 2664 states have internal predecessors, (3327), 457 states have call successors, (457), 180 states have call predecessors, (457), 207 states have return successors, (564), 496 states have call predecessors, (564), 456 states have call successors, (564) [2022-07-23 00:28:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4348 transitions. [2022-07-23 00:28:37,609 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4348 transitions. Word has length 214 [2022-07-23 00:28:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:37,610 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4348 transitions. [2022-07-23 00:28:37,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-23 00:28:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4348 transitions. [2022-07-23 00:28:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-23 00:28:37,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:37,617 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:28:37,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 00:28:37,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 00:28:37,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash -250016649, now seen corresponding path program 2 times [2022-07-23 00:28:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:37,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220464450] [2022-07-23 00:28:37,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:28:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:28:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:28:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:28:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:28:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:28:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 00:28:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 00:28:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:28:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 00:28:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 00:28:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 00:28:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 00:28:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 00:28:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-23 00:28:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:38,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220464450] [2022-07-23 00:28:38,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220464450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:38,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102245774] [2022-07-23 00:28:38,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:28:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:38,228 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) [2022-07-23 00:28:38,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 00:28:38,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 00:28:38,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:28:38,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-23 00:28:38,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:38,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:38,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-23 00:28:39,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:28:39,057 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1316 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1316) |c_#memory_int|)) is different from true [2022-07-23 00:28:39,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:28:39,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:39,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:28:39,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:28:39,140 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:28:39,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:28:39,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:28:47,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:28:59,419 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:28:59,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:28:59,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:29:15,995 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 00:29:15,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 00:29:40,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15