./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 eb692b52 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-?-eb692b5 [2022-07-20 00:10:56,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:10:56,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:10:56,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:10:56,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:10:56,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:10:56,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:10:56,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:10:56,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:10:56,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:10:56,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:10:56,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:10:56,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:10:56,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:10:56,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:10:56,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:10:56,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:10:56,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:10:56,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:10:56,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:10:56,361 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:10:56,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:10:56,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:10:56,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:10:56,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:10:56,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:10:56,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:10:56,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:10:56,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:10:56,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:10:56,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:10:56,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:10:56,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:10:56,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:10:56,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:10:56,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:10:56,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:10:56,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:10:56,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:10:56,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:10:56,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:10:56,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:10:56,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:10:56,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:10:56,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:10:56,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:10:56,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:10:56,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:10:56,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:10:56,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:10:56,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:10:56,405 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:10:56,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:10:56,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:10:56,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:10:56,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:10:56,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:10:56,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:10:56,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:10:56,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:10:56,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:10:56,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:10:56,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:10:56,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:10:56,409 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:10:56,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:10:56,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:10:56,410 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-20 00:10:56,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:10:56,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:10:56,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:10:56,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:10:56,623 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:10:56,624 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-20 00:10:56,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16493bea/de9b760939ae403f9fc775447e9cd3ee/FLAG6ddc5cc82 [2022-07-20 00:10:57,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:10:57,200 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-20 00:10:57,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16493bea/de9b760939ae403f9fc775447e9cd3ee/FLAG6ddc5cc82 [2022-07-20 00:10:57,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16493bea/de9b760939ae403f9fc775447e9cd3ee [2022-07-20 00:10:57,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:10:57,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:10:57,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:10:57,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:10:57,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:10:57,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:10:57" (1/1) ... [2022-07-20 00:10:57,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5602fe4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:57, skipping insertion in model container [2022-07-20 00:10:57,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:10:57" (1/1) ... [2022-07-20 00:10:57,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:10:57,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:10:58,249 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-20 00:10:58,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:10:58,282 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:10:58,414 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-20 00:10:58,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:10:58,458 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:10:58,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58 WrapperNode [2022-07-20 00:10:58,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:10:58,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:10:58,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:10:58,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:10:58,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,553 INFO L137 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 781 [2022-07-20 00:10:58,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:10:58,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:10:58,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:10:58,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:10:58,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:10:58,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:10:58,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:10:58,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:10:58,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (1/1) ... [2022-07-20 00:10:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:10:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:10:58,677 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-20 00:10:58,703 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-20 00:10:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:10:58,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:10:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:10:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 00:10:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 00:10:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:10:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:10:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:10:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:10:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-20 00:10:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-20 00:10:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:10:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:10:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:10:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:10:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:10:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-20 00:10:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-20 00:10:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 00:10:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 00:10:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:10:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 00:10:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-20 00:10:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-20 00:10:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-20 00:10:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-20 00:10:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-20 00:10:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-20 00:10:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:10:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:10:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:10:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 00:10:58,721 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 00:10:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 00:10:58,721 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 00:10:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:10:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:10:58,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:10:58,946 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:10:58,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:10:59,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:10:59,450 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:10:59,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:10:59,463 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:10:59,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:10:59 BoogieIcfgContainer [2022-07-20 00:10:59,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:10:59,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:10:59,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:10:59,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:10:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:10:57" (1/3) ... [2022-07-20 00:10:59,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fcd748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:10:59, skipping insertion in model container [2022-07-20 00:10:59,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:10:58" (2/3) ... [2022-07-20 00:10:59,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fcd748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:10:59, skipping insertion in model container [2022-07-20 00:10:59,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:10:59" (3/3) ... [2022-07-20 00:10:59,472 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-20 00:10:59,482 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:10:59,483 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:10:59,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:10:59,537 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@7da00fc6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38fc0bc7 [2022-07-20 00:10:59,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:10:59,544 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-20 00:10:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 00:10:59,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:10:59,553 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-20 00:10:59,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:10:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:10:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash -949146533, now seen corresponding path program 1 times [2022-07-20 00:10:59,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:10:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135587747] [2022-07-20 00:10:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:10:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:10:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:10:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:10:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:10:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:10:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:10:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:10:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:10:59,933 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-20 00:10:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:10:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135587747] [2022-07-20 00:10:59,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135587747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:10:59,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:10:59,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:10:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160883200] [2022-07-20 00:10:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:10:59,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:10:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:10:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:10:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:10:59,971 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-20 00:11:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:00,224 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-07-20 00:11:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:11:00,227 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-20 00:11:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:00,236 INFO L225 Difference]: With dead ends: 476 [2022-07-20 00:11:00,236 INFO L226 Difference]: Without dead ends: 233 [2022-07-20 00:11:00,240 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-20 00:11:00,242 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 90 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 00:11:00,242 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-20 00:11:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-20 00:11:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-07-20 00:11:00,317 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-20 00:11:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 295 transitions. [2022-07-20 00:11:00,327 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 295 transitions. Word has length 32 [2022-07-20 00:11:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:00,327 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 295 transitions. [2022-07-20 00:11:00,327 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-20 00:11:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 295 transitions. [2022-07-20 00:11:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 00:11:00,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:00,329 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-20 00:11:00,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:11:00,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -526444707, now seen corresponding path program 1 times [2022-07-20 00:11:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:00,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124341917] [2022-07-20 00:11:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:00,431 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-20 00:11:00,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124341917] [2022-07-20 00:11:00,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124341917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:00,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:00,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:11:00,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140352034] [2022-07-20 00:11:00,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:00,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:00,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:00,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:11:00,435 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-20 00:11:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:00,823 INFO L93 Difference]: Finished difference Result 658 states and 868 transitions. [2022-07-20 00:11:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:11:00,824 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-20 00:11:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:00,832 INFO L225 Difference]: With dead ends: 658 [2022-07-20 00:11:00,833 INFO L226 Difference]: Without dead ends: 437 [2022-07-20 00:11:00,837 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-20 00:11:00,842 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:00,842 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.3s Time] [2022-07-20 00:11:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-20 00:11:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2022-07-20 00:11:00,886 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-20 00:11:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-07-20 00:11:00,893 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 32 [2022-07-20 00:11:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:00,894 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-07-20 00:11:00,894 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-20 00:11:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-07-20 00:11:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 00:11:00,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:00,897 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-20 00:11:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:11:00,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1956153286, now seen corresponding path program 1 times [2022-07-20 00:11:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340260335] [2022-07-20 00:11:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:00,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,057 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-20 00:11:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340260335] [2022-07-20 00:11:01,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340260335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:01,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:01,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:11:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801339566] [2022-07-20 00:11:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:01,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:11:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:11:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:11:01,062 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-20 00:11:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:01,594 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-07-20 00:11:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:11:01,596 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-20 00:11:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:01,599 INFO L225 Difference]: With dead ends: 1000 [2022-07-20 00:11:01,599 INFO L226 Difference]: Without dead ends: 592 [2022-07-20 00:11:01,600 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-20 00:11:01,601 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 626 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:01,601 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.5s Time] [2022-07-20 00:11:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-20 00:11:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2022-07-20 00:11:01,637 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-20 00:11:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2022-07-20 00:11:01,640 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 55 [2022-07-20 00:11:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:01,643 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2022-07-20 00:11:01,643 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-20 00:11:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2022-07-20 00:11:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 00:11:01,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:01,649 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-20 00:11:01,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:11:01,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1601497338, now seen corresponding path program 1 times [2022-07-20 00:11:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345785448] [2022-07-20 00:11:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:01,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:01,772 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-20 00:11:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345785448] [2022-07-20 00:11:01,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345785448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:01,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:01,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:11:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984985326] [2022-07-20 00:11:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:01,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:11:01,780 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-20 00:11:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:02,098 INFO L93 Difference]: Finished difference Result 1269 states and 1671 transitions. [2022-07-20 00:11:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:11:02,099 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-20 00:11:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:02,102 INFO L225 Difference]: With dead ends: 1269 [2022-07-20 00:11:02,103 INFO L226 Difference]: Without dead ends: 858 [2022-07-20 00:11:02,104 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-20 00:11:02,105 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 391 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:02,105 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.3s Time] [2022-07-20 00:11:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-07-20 00:11:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 828. [2022-07-20 00:11:02,135 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-20 00:11:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1077 transitions. [2022-07-20 00:11:02,139 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1077 transitions. Word has length 55 [2022-07-20 00:11:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1077 transitions. [2022-07-20 00:11:02,140 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-20 00:11:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1077 transitions. [2022-07-20 00:11:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 00:11:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:02,142 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-20 00:11:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:11:02,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1893200283, now seen corresponding path program 1 times [2022-07-20 00:11:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145604968] [2022-07-20 00:11:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,235 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-20 00:11:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:02,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145604968] [2022-07-20 00:11:02,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145604968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:02,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:02,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:11:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338946144] [2022-07-20 00:11:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:11:02,238 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-20 00:11:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:02,460 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2022-07-20 00:11:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:11:02,460 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-20 00:11:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:02,464 INFO L225 Difference]: With dead ends: 858 [2022-07-20 00:11:02,464 INFO L226 Difference]: Without dead ends: 855 [2022-07-20 00:11:02,464 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-20 00:11:02,465 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-20 00:11:02,465 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-20 00:11:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-07-20 00:11:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 827. [2022-07-20 00:11:02,491 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-20 00:11:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1075 transitions. [2022-07-20 00:11:02,493 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1075 transitions. Word has length 56 [2022-07-20 00:11:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:02,494 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1075 transitions. [2022-07-20 00:11:02,494 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-20 00:11:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1075 transitions. [2022-07-20 00:11:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 00:11:02,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:02,495 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-20 00:11:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:11:02,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1440318295, now seen corresponding path program 1 times [2022-07-20 00:11:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926372101] [2022-07-20 00:11:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,571 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-20 00:11:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:02,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926372101] [2022-07-20 00:11:02,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926372101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:02,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:02,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:11:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563883106] [2022-07-20 00:11:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:02,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:02,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:02,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:11:02,573 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-20 00:11:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:02,791 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2022-07-20 00:11:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:11:02,791 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-20 00:11:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:02,818 INFO L225 Difference]: With dead ends: 857 [2022-07-20 00:11:02,819 INFO L226 Difference]: Without dead ends: 854 [2022-07-20 00:11:02,820 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-20 00:11:02,821 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:02,821 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.2s Time] [2022-07-20 00:11:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-20 00:11:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2022-07-20 00:11:02,858 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-20 00:11:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1073 transitions. [2022-07-20 00:11:02,865 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1073 transitions. Word has length 57 [2022-07-20 00:11:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:02,866 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1073 transitions. [2022-07-20 00:11:02,866 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-20 00:11:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1073 transitions. [2022-07-20 00:11:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 00:11:02,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:02,867 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-20 00:11:02,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:11:02,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1700174242, now seen corresponding path program 1 times [2022-07-20 00:11:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:02,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780531015] [2022-07-20 00:11:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,003 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-20 00:11:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780531015] [2022-07-20 00:11:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780531015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:03,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:11:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180138859] [2022-07-20 00:11:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:11:03,005 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-20 00:11:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:03,242 INFO L93 Difference]: Finished difference Result 856 states and 1122 transitions. [2022-07-20 00:11:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:11:03,243 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-20 00:11:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:03,246 INFO L225 Difference]: With dead ends: 856 [2022-07-20 00:11:03,246 INFO L226 Difference]: Without dead ends: 845 [2022-07-20 00:11:03,247 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-20 00:11:03,247 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 273 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:03,247 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.2s Time] [2022-07-20 00:11:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-20 00:11:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 817. [2022-07-20 00:11:03,269 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-20 00:11:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1061 transitions. [2022-07-20 00:11:03,271 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1061 transitions. Word has length 58 [2022-07-20 00:11:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:03,272 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1061 transitions. [2022-07-20 00:11:03,272 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-20 00:11:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1061 transitions. [2022-07-20 00:11:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-20 00:11:03,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:03,274 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-20 00:11:03,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:11:03,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1841089283, now seen corresponding path program 1 times [2022-07-20 00:11:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579357935] [2022-07-20 00:11:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 00:11:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 00:11:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 00:11:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:11:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:11:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 00:11:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 00:11:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 00:11:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:11:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:11:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,435 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-20 00:11:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579357935] [2022-07-20 00:11:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579357935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:03,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:11:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28779211] [2022-07-20 00:11:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:11:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:11:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:11:03,438 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-20 00:11:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:03,757 INFO L93 Difference]: Finished difference Result 1711 states and 2241 transitions. [2022-07-20 00:11:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:11:03,758 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-20 00:11:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:03,761 INFO L225 Difference]: With dead ends: 1711 [2022-07-20 00:11:03,761 INFO L226 Difference]: Without dead ends: 909 [2022-07-20 00:11:03,763 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-20 00:11:03,764 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 90 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:03,764 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.3s Time] [2022-07-20 00:11:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-07-20 00:11:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2022-07-20 00:11:03,789 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-20 00:11:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1135 transitions. [2022-07-20 00:11:03,792 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1135 transitions. Word has length 153 [2022-07-20 00:11:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:03,793 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1135 transitions. [2022-07-20 00:11:03,793 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-20 00:11:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1135 transitions. [2022-07-20 00:11:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 00:11:03,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:03,795 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-20 00:11:03,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:11:03,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 314942574, now seen corresponding path program 1 times [2022-07-20 00:11:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:03,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817495361] [2022-07-20 00:11:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:11:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:11:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:11:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 00:11:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 00:11:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:11:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 00:11:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:11:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:03,943 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-20 00:11:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817495361] [2022-07-20 00:11:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817495361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:03,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:03,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 00:11:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111191641] [2022-07-20 00:11:03,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:03,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 00:11:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 00:11:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:11:03,945 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-20 00:11:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:04,329 INFO L93 Difference]: Finished difference Result 2321 states and 3120 transitions. [2022-07-20 00:11:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:11:04,330 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-20 00:11:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:04,335 INFO L225 Difference]: With dead ends: 2321 [2022-07-20 00:11:04,335 INFO L226 Difference]: Without dead ends: 1469 [2022-07-20 00:11:04,337 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-20 00:11:04,338 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:04,338 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.3s Time] [2022-07-20 00:11:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-20 00:11:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 883. [2022-07-20 00:11:04,370 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-20 00:11:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1147 transitions. [2022-07-20 00:11:04,373 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1147 transitions. Word has length 162 [2022-07-20 00:11:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:04,373 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1147 transitions. [2022-07-20 00:11:04,374 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-20 00:11:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1147 transitions. [2022-07-20 00:11:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-20 00:11:04,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:04,377 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-20 00:11:04,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:11:04,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1067823865, now seen corresponding path program 1 times [2022-07-20 00:11:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:04,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566986242] [2022-07-20 00:11:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 00:11:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 00:11:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:11:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:11:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:11:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:11:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,557 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-20 00:11:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:04,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566986242] [2022-07-20 00:11:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566986242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220742276] [2022-07-20 00:11:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:04,560 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-20 00:11:04,587 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-20 00:11:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:04,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:11:04,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:04,903 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-20 00:11:04,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:11:04,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220742276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:04,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:11:04,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-20 00:11:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120519512] [2022-07-20 00:11:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:11:04,905 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-20 00:11:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:05,055 INFO L93 Difference]: Finished difference Result 2857 states and 3742 transitions. [2022-07-20 00:11:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:11:05,055 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-20 00:11:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:05,062 INFO L225 Difference]: With dead ends: 2857 [2022-07-20 00:11:05,062 INFO L226 Difference]: Without dead ends: 1993 [2022-07-20 00:11:05,065 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-20 00:11:05,065 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 401 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:05,065 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.0s Time] [2022-07-20 00:11:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-20 00:11:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 919. [2022-07-20 00:11:05,127 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-20 00:11:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1191 transitions. [2022-07-20 00:11:05,130 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1191 transitions. Word has length 164 [2022-07-20 00:11:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:05,131 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1191 transitions. [2022-07-20 00:11:05,131 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-20 00:11:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1191 transitions. [2022-07-20 00:11:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-20 00:11:05,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:05,133 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-20 00:11:05,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 00:11:05,347 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-20 00:11:05,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2078941115, now seen corresponding path program 1 times [2022-07-20 00:11:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:05,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532584663] [2022-07-20 00:11:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 00:11:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 00:11:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:11:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:11:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:11:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:11:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,509 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-20 00:11:05,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:05,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532584663] [2022-07-20 00:11:05,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532584663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360214016] [2022-07-20 00:11:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:05,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:05,511 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-20 00:11:05,512 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-20 00:11:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:05,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 00:11:05,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:05,916 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-20 00:11:05,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:11:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360214016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:11:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-07-20 00:11:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188499463] [2022-07-20 00:11:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:05,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:11:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:11:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:11:05,918 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-20 00:11:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:06,057 INFO L93 Difference]: Finished difference Result 2201 states and 2930 transitions. [2022-07-20 00:11:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:11:06,059 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-20 00:11:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:06,063 INFO L225 Difference]: With dead ends: 2201 [2022-07-20 00:11:06,063 INFO L226 Difference]: Without dead ends: 1301 [2022-07-20 00:11:06,065 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-20 00:11:06,065 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-20 00:11:06,065 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-20 00:11:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-20 00:11:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 939. [2022-07-20 00:11:06,124 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-20 00:11:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1227 transitions. [2022-07-20 00:11:06,127 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1227 transitions. Word has length 164 [2022-07-20 00:11:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:06,128 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1227 transitions. [2022-07-20 00:11:06,128 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-20 00:11:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1227 transitions. [2022-07-20 00:11:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-20 00:11:06,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:06,131 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-20 00:11:06,150 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-20 00:11:06,347 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-20 00:11:06,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1954792649, now seen corresponding path program 1 times [2022-07-20 00:11:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:06,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304172350] [2022-07-20 00:11:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 00:11:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 00:11:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:11:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:11:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 00:11:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:11:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 00:11:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,536 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-20 00:11:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:06,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304172350] [2022-07-20 00:11:06,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304172350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:06,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993267775] [2022-07-20 00:11:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:06,538 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-20 00:11:06,539 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-20 00:11:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:06,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 00:11:06,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:06,854 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-20 00:11:06,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:11:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993267775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:06,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:11:06,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-20 00:11:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536526677] [2022-07-20 00:11:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:06,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:11:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:11:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:11:06,857 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-20 00:11:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:06,952 INFO L93 Difference]: Finished difference Result 1879 states and 2467 transitions. [2022-07-20 00:11:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:11:06,952 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-20 00:11:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:06,955 INFO L225 Difference]: With dead ends: 1879 [2022-07-20 00:11:06,956 INFO L226 Difference]: Without dead ends: 959 [2022-07-20 00:11:06,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:11:06,958 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-20 00:11:06,958 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-20 00:11:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-20 00:11:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2022-07-20 00:11:07,002 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-20 00:11:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1235 transitions. [2022-07-20 00:11:07,008 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1235 transitions. Word has length 170 [2022-07-20 00:11:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:07,008 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1235 transitions. [2022-07-20 00:11:07,009 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-20 00:11:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1235 transitions. [2022-07-20 00:11:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-20 00:11:07,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:07,011 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-20 00:11:07,039 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-20 00:11:07,224 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-20 00:11:07,225 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash -794500219, now seen corresponding path program 2 times [2022-07-20 00:11:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:07,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897328207] [2022-07-20 00:11:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:11:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:11:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:11:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:11:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:11:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 00:11:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:07,507 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-20 00:11:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897328207] [2022-07-20 00:11:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897328207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850439807] [2022-07-20 00:11:07,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:11:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:07,510 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-20 00:11:07,511 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-20 00:11:07,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 00:11:07,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:11:07,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 00:11:07,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:07,835 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-20 00:11:07,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:11:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850439807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:11:07,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-20 00:11:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079511817] [2022-07-20 00:11:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:11:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:11:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:11:07,837 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-20 00:11:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:08,067 INFO L93 Difference]: Finished difference Result 1933 states and 2603 transitions. [2022-07-20 00:11:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:11:08,068 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-20 00:11:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:08,073 INFO L225 Difference]: With dead ends: 1933 [2022-07-20 00:11:08,073 INFO L226 Difference]: Without dead ends: 1465 [2022-07-20 00:11:08,075 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-20 00:11:08,075 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-20 00:11:08,076 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-20 00:11:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-07-20 00:11:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 953. [2022-07-20 00:11:08,134 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-20 00:11:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1241 transitions. [2022-07-20 00:11:08,136 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1241 transitions. Word has length 176 [2022-07-20 00:11:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:08,137 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1241 transitions. [2022-07-20 00:11:08,137 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-20 00:11:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1241 transitions. [2022-07-20 00:11:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-20 00:11:08,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:08,140 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-20 00:11:08,158 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-20 00:11:08,357 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-20 00:11:08,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1273770335, now seen corresponding path program 1 times [2022-07-20 00:11:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:08,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404508390] [2022-07-20 00:11:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:11:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:11:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:11:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:11:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:11:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:11:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 00:11:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 00:11:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,582 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-20 00:11:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:08,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404508390] [2022-07-20 00:11:08,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404508390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:08,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692040991] [2022-07-20 00:11:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:08,584 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-20 00:11:08,585 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-20 00:11:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:08,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 00:11:08,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:09,114 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-20 00:11:09,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:11:09,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692040991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:09,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:11:09,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-20 00:11:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357766464] [2022-07-20 00:11:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:09,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:11:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:11:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:11:09,116 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-20 00:11:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:09,366 INFO L93 Difference]: Finished difference Result 2823 states and 3686 transitions. [2022-07-20 00:11:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:11:09,366 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-20 00:11:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:09,375 INFO L225 Difference]: With dead ends: 2823 [2022-07-20 00:11:09,375 INFO L226 Difference]: Without dead ends: 2815 [2022-07-20 00:11:09,376 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-20 00:11:09,377 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-20 00:11:09,377 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-20 00:11:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-07-20 00:11:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2801. [2022-07-20 00:11:09,549 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-20 00:11:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3665 transitions. [2022-07-20 00:11:09,560 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3665 transitions. Word has length 207 [2022-07-20 00:11:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:09,560 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 3665 transitions. [2022-07-20 00:11:09,561 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-20 00:11:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3665 transitions. [2022-07-20 00:11:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-20 00:11:09,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:09,565 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-20 00:11:09,587 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-20 00:11:09,779 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-20 00:11:09,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 262653085, now seen corresponding path program 1 times [2022-07-20 00:11:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840887696] [2022-07-20 00:11:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:11:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:11:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:11:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:11:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:11:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:11:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 00:11:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 00:11:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:09,952 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-20 00:11:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840887696] [2022-07-20 00:11:09,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840887696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:11:09,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:11:09,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:11:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501542991] [2022-07-20 00:11:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:11:09,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:11:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:11:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:11:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:11:09,955 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-20 00:11:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:11:10,901 INFO L93 Difference]: Finished difference Result 8991 states and 11824 transitions. [2022-07-20 00:11:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 00:11:10,902 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-20 00:11:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:11:10,924 INFO L225 Difference]: With dead ends: 8991 [2022-07-20 00:11:10,925 INFO L226 Difference]: Without dead ends: 6209 [2022-07-20 00:11:10,934 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-20 00:11:10,935 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:11:10,935 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.5s Time] [2022-07-20 00:11:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2022-07-20 00:11:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 2813. [2022-07-20 00:11:11,213 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-20 00:11:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3677 transitions. [2022-07-20 00:11:11,222 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3677 transitions. Word has length 207 [2022-07-20 00:11:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:11:11,224 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3677 transitions. [2022-07-20 00:11:11,224 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-20 00:11:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3677 transitions. [2022-07-20 00:11:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-20 00:11:11,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:11:11,229 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-20 00:11:11,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 00:11:11,230 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:11:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:11:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1700386181, now seen corresponding path program 1 times [2022-07-20 00:11:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:11:11,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141701316] [2022-07-20 00:11:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:11:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:11:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:11:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:11:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:11:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:11:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:11:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:11:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:11:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:11:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:11:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:11:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:11:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:11:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 00:11:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:11:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 00:11:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,584 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-20 00:11:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:11:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141701316] [2022-07-20 00:11:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141701316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:11:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722379184] [2022-07-20 00:11:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:11:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:11:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:11:11,600 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-20 00:11:11,602 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-20 00:11:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:11:11,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-20 00:11:12,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:11:12,046 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-20 00:11:12,087 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-20 00:11:12,392 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-20 00:11:12,429 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-20 00:11:12,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:11:12,454 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-20 00:11:12,461 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 00:11:12,461 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-20 00:12:25,479 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-20 00:12:37,613 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-20 00:12:37,622 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-20 00:12:49,764 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-20 00:12:49,770 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-20 00:12:49,808 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-20 00:12:49,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:12:49,830 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-20 00:12:49,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722379184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:12:49,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:12:49,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-07-20 00:12:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543879912] [2022-07-20 00:12:49,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:12:49,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 00:12:49,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:12:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 00:12:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1426, Unknown=9, NotChecked=154, Total=1722 [2022-07-20 00:12:49,847 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-20 00:14:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:11,811 INFO L93 Difference]: Finished difference Result 7649 states and 10194 transitions. [2022-07-20 00:14:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 00:14:11,812 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-20 00:14:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:11,831 INFO L225 Difference]: With dead ends: 7649 [2022-07-20 00:14:11,831 INFO L226 Difference]: Without dead ends: 4855 [2022-07-20 00:14:11,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 275 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 177.8s TimeCoverageRelationStatistics Valid=322, Invalid=3798, Unknown=48, NotChecked=254, Total=4422 [2022-07-20 00:14:11,839 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 661 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:11,840 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.0s Time] [2022-07-20 00:14:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2022-07-20 00:14:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3317. [2022-07-20 00:14:12,075 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-20 00:14:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4348 transitions. [2022-07-20 00:14:12,113 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4348 transitions. Word has length 214 [2022-07-20 00:14:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:12,114 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4348 transitions. [2022-07-20 00:14:12,114 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-20 00:14:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4348 transitions. [2022-07-20 00:14:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-20 00:14:12,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:12,121 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-20 00:14:12,145 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-20 00:14:12,335 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-20 00:14:12,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash -250016649, now seen corresponding path program 2 times [2022-07-20 00:14:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:12,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044109130] [2022-07-20 00:14:12,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 00:14:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:14:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:14:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:14:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:14:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 00:14:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:14:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:14:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 00:14:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 00:14:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 00:14:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-20 00:14:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 00:14:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:12,703 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-20 00:14:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044109130] [2022-07-20 00:14:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044109130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:14:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824375880] [2022-07-20 00:14:12,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:14:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:14:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:14:12,705 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-20 00:14:12,707 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-20 00:14:13,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 00:14:13,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:14:13,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-20 00:14:13,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:14:13,147 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-20 00:14:13,187 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-20 00:14:13,486 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-20 00:14:13,490 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-20 00:14:13,537 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-20 00:14:13,539 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-20 00:14:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:14:13,561 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-20 00:14:13,573 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 00:14:13,574 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-20 00:14:13,660 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-20 00:14:21,750 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-20 00:14:33,883 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 00:14:33,884 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-20 00:14:34,132 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-20 00:14:50,434 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 00:14:50,434 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-20 00:15:15,016 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-20 00:15:27,154 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-20 00:15:27,164 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