./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/product-lines/email_spec0_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 05:57:16,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 05:57:16,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 05:57:16,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 05:57:16,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 05:57:16,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 05:57:16,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 05:57:16,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 05:57:16,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 05:57:16,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 05:57:16,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 05:57:16,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 05:57:16,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 05:57:16,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 05:57:16,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 05:57:16,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 05:57:16,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 05:57:16,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 05:57:16,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 05:57:16,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 05:57:16,450 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 05:57:16,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 05:57:16,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 05:57:16,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 05:57:16,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 05:57:16,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 05:57:16,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 05:57:16,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 05:57:16,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 05:57:16,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 05:57:16,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 05:57:16,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 05:57:16,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 05:57:16,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 05:57:16,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 05:57:16,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 05:57:16,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 05:57:16,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 05:57:16,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 05:57:16,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 05:57:16,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 05:57:16,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 05:57:16,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 05:57:16,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 05:57:16,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 05:57:16,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 05:57:16,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 05:57:16,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 05:57:16,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 05:57:16,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 05:57:16,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 05:57:16,490 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 05:57:16,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 05:57:16,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 05:57:16,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 05:57:16,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 05:57:16,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 05:57:16,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 05:57:16,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 05:57:16,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 05:57:16,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 05:57:16,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 05:57:16,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:57:16,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 05:57:16,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 05:57:16,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 05:57:16,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 05:57:16,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 05:57:16,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 05:57:16,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 05:57:16,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 05:57:16,495 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 [2022-07-12 05:57:16,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 05:57:16,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 05:57:16,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 05:57:16,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 05:57:16,745 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 05:57:16,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2022-07-12 05:57:16,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9be113/48fa38052f0644a8a55c9f41f2d7888b/FLAG5d0e71a9b [2022-07-12 05:57:17,312 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 05:57:17,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2022-07-12 05:57:17,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9be113/48fa38052f0644a8a55c9f41f2d7888b/FLAG5d0e71a9b [2022-07-12 05:57:17,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9be113/48fa38052f0644a8a55c9f41f2d7888b [2022-07-12 05:57:17,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 05:57:17,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 05:57:17,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 05:57:17,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 05:57:17,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 05:57:17,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:57:17" (1/1) ... [2022-07-12 05:57:17,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6886a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:17, skipping insertion in model container [2022-07-12 05:57:17,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:57:17" (1/1) ... [2022-07-12 05:57:17,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 05:57:17,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 05:57:18,235 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/product-lines/email_spec0_product19.cil.c[39319,39332] [2022-07-12 05:57:18,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:57:18,294 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 05:57:18,353 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/product-lines/email_spec0_product19.cil.c[39319,39332] [2022-07-12 05:57:18,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:57:18,409 INFO L208 MainTranslator]: Completed translation [2022-07-12 05:57:18,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18 WrapperNode [2022-07-12 05:57:18,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 05:57:18,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 05:57:18,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 05:57:18,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 05:57:18,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,486 INFO L137 Inliner]: procedures = 127, calls = 198, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 992 [2022-07-12 05:57:18,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 05:57:18,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 05:57:18,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 05:57:18,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 05:57:18,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 05:57:18,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 05:57:18,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 05:57:18,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 05:57:18,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (1/1) ... [2022-07-12 05:57:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:57:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:18,636 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-12 05:57:18,655 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-12 05:57:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2022-07-12 05:57:18,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2022-07-12 05:57:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2022-07-12 05:57:18,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2022-07-12 05:57:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2022-07-12 05:57:18,671 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2022-07-12 05:57:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2022-07-12 05:57:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2022-07-12 05:57:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2022-07-12 05:57:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2022-07-12 05:57:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2022-07-12 05:57:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2022-07-12 05:57:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-07-12 05:57:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2022-07-12 05:57:18,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2022-07-12 05:57:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2022-07-12 05:57:18,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2022-07-12 05:57:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 05:57:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2022-07-12 05:57:18,673 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2022-07-12 05:57:18,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2022-07-12 05:57:18,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2022-07-12 05:57:18,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2022-07-12 05:57:18,674 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2022-07-12 05:57:18,674 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2022-07-12 05:57:18,674 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2022-07-12 05:57:18,674 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2022-07-12 05:57:18,674 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2022-07-12 05:57:18,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2022-07-12 05:57:18,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2022-07-12 05:57:18,675 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2022-07-12 05:57:18,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2022-07-12 05:57:18,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 05:57:18,675 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2022-07-12 05:57:18,676 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2022-07-12 05:57:18,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 05:57:18,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 05:57:18,913 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 05:57:18,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 05:57:19,471 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 05:57:19,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 05:57:19,482 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 05:57:19,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:57:19 BoogieIcfgContainer [2022-07-12 05:57:19,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 05:57:19,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 05:57:19,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 05:57:19,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 05:57:19,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:57:17" (1/3) ... [2022-07-12 05:57:19,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f9cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:57:19, skipping insertion in model container [2022-07-12 05:57:19,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:57:18" (2/3) ... [2022-07-12 05:57:19,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f9cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:57:19, skipping insertion in model container [2022-07-12 05:57:19,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:57:19" (3/3) ... [2022-07-12 05:57:19,496 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product19.cil.c [2022-07-12 05:57:19,505 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 05:57:19,505 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 05:57:19,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 05:57:19,544 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@19da1605, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b399088 [2022-07-12 05:57:19,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 05:57:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-12 05:57:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 05:57:19,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:19,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:19,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash -756518862, now seen corresponding path program 1 times [2022-07-12 05:57:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:19,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539213202] [2022-07-12 05:57:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:19,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:57:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 05:57:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:57:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 05:57:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 05:57:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:57:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 05:57:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 05:57:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 05:57:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:57:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 05:57:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539213202] [2022-07-12 05:57:19,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539213202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254408631] [2022-07-12 05:57:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:19,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:19,997 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-12 05:57:20,019 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-12 05:57:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 05:57:20,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 05:57:20,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:57:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254408631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:20,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:57:20,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2022-07-12 05:57:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357960701] [2022-07-12 05:57:20,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 05:57:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 05:57:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:57:20,341 INFO L87 Difference]: Start difference. First operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:20,373 INFO L93 Difference]: Finished difference Result 448 states and 662 transitions. [2022-07-12 05:57:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 05:57:20,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2022-07-12 05:57:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:20,382 INFO L225 Difference]: With dead ends: 448 [2022-07-12 05:57:20,382 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 05:57:20,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:57:20,393 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:20,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:57:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 05:57:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-07-12 05:57:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.5276595744680852) internal successors, (359), 236 states have internal predecessors, (359), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-12 05:57:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2022-07-12 05:57:20,438 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 104 [2022-07-12 05:57:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:20,438 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2022-07-12 05:57:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2022-07-12 05:57:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:57:20,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:20,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:20,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 05:57:20,663 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,SelfDestructingSolverStorable0 [2022-07-12 05:57:20,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2087935493, now seen corresponding path program 1 times [2022-07-12 05:57:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:20,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124752632] [2022-07-12 05:57:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:57:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 05:57:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:57:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 05:57:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 05:57:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:57:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:57:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 05:57:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 05:57:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:57:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 05:57:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124752632] [2022-07-12 05:57:20,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124752632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:20,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809252100] [2022-07-12 05:57:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:20,807 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-12 05:57:20,808 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-12 05:57:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 05:57:21,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 05:57:21,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:57:21,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809252100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:21,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:57:21,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 05:57:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579013662] [2022-07-12 05:57:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:57:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:57:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:21,110 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:21,160 INFO L93 Difference]: Finished difference Result 438 states and 643 transitions. [2022-07-12 05:57:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:57:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-07-12 05:57:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:21,168 INFO L225 Difference]: With dead ends: 438 [2022-07-12 05:57:21,168 INFO L226 Difference]: Without dead ends: 297 [2022-07-12 05:57:21,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:21,170 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 1 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:21,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 878 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:57:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-12 05:57:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2022-07-12 05:57:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 237 states have (on average 1.5232067510548524) internal successors, (361), 238 states have internal predecessors, (361), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-12 05:57:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 444 transitions. [2022-07-12 05:57:21,197 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 444 transitions. Word has length 105 [2022-07-12 05:57:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:21,197 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 444 transitions. [2022-07-12 05:57:21,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 444 transitions. [2022-07-12 05:57:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 05:57:21,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:21,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:21,226 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-12 05:57:21,410 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,SelfDestructingSolverStorable1 [2022-07-12 05:57:21,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash 681092572, now seen corresponding path program 1 times [2022-07-12 05:57:21,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:21,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935519374] [2022-07-12 05:57:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:21,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:57:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 05:57:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:57:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 05:57:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 05:57:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:57:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 05:57:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 05:57:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:57:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 05:57:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 05:57:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:21,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935519374] [2022-07-12 05:57:21,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935519374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:21,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472768982] [2022-07-12 05:57:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:21,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:21,503 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-12 05:57:21,504 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-12 05:57:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 05:57:21,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 05:57:21,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:57:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472768982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:57:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 05:57:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906627976] [2022-07-12 05:57:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:21,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:57:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:57:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:21,722 INFO L87 Difference]: Start difference. First operand 296 states and 444 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:21,751 INFO L93 Difference]: Finished difference Result 622 states and 947 transitions. [2022-07-12 05:57:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:57:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2022-07-12 05:57:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:21,754 INFO L225 Difference]: With dead ends: 622 [2022-07-12 05:57:21,754 INFO L226 Difference]: Without dead ends: 353 [2022-07-12 05:57:21,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:21,756 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 107 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:21,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 855 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:57:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-12 05:57:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2022-07-12 05:57:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 275 states have (on average 1.538181818181818) internal successors, (423), 276 states have internal predecessors, (423), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-07-12 05:57:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2022-07-12 05:57:21,775 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 111 [2022-07-12 05:57:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:21,776 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2022-07-12 05:57:21,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-07-12 05:57:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 05:57:21,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:21,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:21,803 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-12 05:57:22,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:22,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 740763177, now seen corresponding path program 1 times [2022-07-12 05:57:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283218839] [2022-07-12 05:57:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:57:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 05:57:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:57:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:57:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:57:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 05:57:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 05:57:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 05:57:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 05:57:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 05:57:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 05:57:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283218839] [2022-07-12 05:57:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283218839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896113175] [2022-07-12 05:57:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:22,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:22,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:22,089 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-12 05:57:22,090 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-12 05:57:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 05:57:22,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 05:57:22,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:57:22,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896113175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:22,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:57:22,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-12 05:57:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953728418] [2022-07-12 05:57:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:22,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:57:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:57:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-12 05:57:22,352 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:22,397 INFO L93 Difference]: Finished difference Result 681 states and 1046 transitions. [2022-07-12 05:57:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 05:57:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2022-07-12 05:57:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:22,402 INFO L225 Difference]: With dead ends: 681 [2022-07-12 05:57:22,402 INFO L226 Difference]: Without dead ends: 347 [2022-07-12 05:57:22,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:22,404 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 125 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:22,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1587 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:57:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-12 05:57:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-07-12 05:57:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 276 states have (on average 1.536231884057971) internal successors, (424), 278 states have internal predecessors, (424), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2022-07-12 05:57:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 531 transitions. [2022-07-12 05:57:22,421 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 531 transitions. Word has length 112 [2022-07-12 05:57:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:22,422 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 531 transitions. [2022-07-12 05:57:22,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 531 transitions. [2022-07-12 05:57:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 05:57:22,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:22,424 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:22,444 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-12 05:57:22,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:22,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 704008068, now seen corresponding path program 1 times [2022-07-12 05:57:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:22,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796195888] [2022-07-12 05:57:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 05:57:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 05:57:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 05:57:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 05:57:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 05:57:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 05:57:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 05:57:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 05:57:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 05:57:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796195888] [2022-07-12 05:57:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796195888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117228042] [2022-07-12 05:57:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:22,788 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-12 05:57:22,803 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-12 05:57:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 05:57:23,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 05:57:23,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:57:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117228042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:23,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:57:23,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 05:57:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184238322] [2022-07-12 05:57:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:23,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:57:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:57:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:57:23,089 INFO L87 Difference]: Start difference. First operand 347 states and 531 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:23,144 INFO L93 Difference]: Finished difference Result 683 states and 1051 transitions. [2022-07-12 05:57:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 05:57:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2022-07-12 05:57:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:23,147 INFO L225 Difference]: With dead ends: 683 [2022-07-12 05:57:23,147 INFO L226 Difference]: Without dead ends: 349 [2022-07-12 05:57:23,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:57:23,150 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 124 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1576 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:57:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-12 05:57:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-07-12 05:57:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2022-07-12 05:57:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 537 transitions. [2022-07-12 05:57:23,173 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 537 transitions. Word has length 113 [2022-07-12 05:57:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:23,173 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 537 transitions. [2022-07-12 05:57:23,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 537 transitions. [2022-07-12 05:57:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 05:57:23,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:23,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 05:57:23,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:23,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash 857466609, now seen corresponding path program 1 times [2022-07-12 05:57:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:23,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442196073] [2022-07-12 05:57:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:23,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:57:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:57:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 05:57:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 05:57:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 05:57:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 05:57:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 05:57:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 05:57:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 05:57:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442196073] [2022-07-12 05:57:23,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442196073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:23,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:23,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:57:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301926806] [2022-07-12 05:57:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:23,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:57:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:57:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:57:23,505 INFO L87 Difference]: Start difference. First operand 349 states and 537 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:24,833 INFO L93 Difference]: Finished difference Result 843 states and 1294 transitions. [2022-07-12 05:57:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 05:57:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2022-07-12 05:57:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:24,837 INFO L225 Difference]: With dead ends: 843 [2022-07-12 05:57:24,837 INFO L226 Difference]: Without dead ends: 517 [2022-07-12 05:57:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:57:24,838 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 1079 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:24,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1391 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 05:57:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-12 05:57:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 349. [2022-07-12 05:57:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2022-07-12 05:57:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2022-07-12 05:57:24,857 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 114 [2022-07-12 05:57:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:24,857 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2022-07-12 05:57:24,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2022-07-12 05:57:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 05:57:24,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:24,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:24,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 05:57:24,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 748732846, now seen corresponding path program 2 times [2022-07-12 05:57:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:24,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406863749] [2022-07-12 05:57:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:57:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:57:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:57:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 05:57:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 05:57:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 05:57:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 05:57:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 05:57:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 05:57:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406863749] [2022-07-12 05:57:24,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406863749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:24,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:24,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:57:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947108360] [2022-07-12 05:57:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:24,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:57:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:57:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:57:24,942 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:26,298 INFO L93 Difference]: Finished difference Result 845 states and 1297 transitions. [2022-07-12 05:57:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 05:57:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2022-07-12 05:57:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:26,302 INFO L225 Difference]: With dead ends: 845 [2022-07-12 05:57:26,302 INFO L226 Difference]: Without dead ends: 519 [2022-07-12 05:57:26,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:57:26,304 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 1056 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:26,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1402 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 05:57:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-12 05:57:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 351. [2022-07-12 05:57:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2022-07-12 05:57:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 539 transitions. [2022-07-12 05:57:26,322 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 539 transitions. Word has length 115 [2022-07-12 05:57:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:26,322 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 539 transitions. [2022-07-12 05:57:26,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:57:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 539 transitions. [2022-07-12 05:57:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 05:57:26,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:26,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:26,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 05:57:26,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1183302676, now seen corresponding path program 1 times [2022-07-12 05:57:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:26,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117548786] [2022-07-12 05:57:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 05:57:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 05:57:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 05:57:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 05:57:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 05:57:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 05:57:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 05:57:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 05:57:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:26,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117548786] [2022-07-12 05:57:26,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117548786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:26,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:26,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 05:57:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177473083] [2022-07-12 05:57:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:26,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 05:57:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 05:57:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 05:57:26,473 INFO L87 Difference]: Start difference. First operand 351 states and 539 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 05:57:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:28,226 INFO L93 Difference]: Finished difference Result 843 states and 1292 transitions. [2022-07-12 05:57:28,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:57:28,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-07-12 05:57:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:28,229 INFO L225 Difference]: With dead ends: 843 [2022-07-12 05:57:28,230 INFO L226 Difference]: Without dead ends: 519 [2022-07-12 05:57:28,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-12 05:57:28,231 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 1171 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:28,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1693 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 05:57:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-12 05:57:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 351. [2022-07-12 05:57:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2022-07-12 05:57:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 538 transitions. [2022-07-12 05:57:28,248 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 538 transitions. Word has length 116 [2022-07-12 05:57:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:28,248 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 538 transitions. [2022-07-12 05:57:28,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 05:57:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 538 transitions. [2022-07-12 05:57:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 05:57:28,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:28,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:28,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 05:57:28,251 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 158463807, now seen corresponding path program 2 times [2022-07-12 05:57:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:28,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60533080] [2022-07-12 05:57:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:57:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:57:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 05:57:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 05:57:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 05:57:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 05:57:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 05:57:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 05:57:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60533080] [2022-07-12 05:57:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60533080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:28,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:28,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 05:57:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753107554] [2022-07-12 05:57:28,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 05:57:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 05:57:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 05:57:28,351 INFO L87 Difference]: Start difference. First operand 351 states and 538 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 05:57:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:30,304 INFO L93 Difference]: Finished difference Result 845 states and 1298 transitions. [2022-07-12 05:57:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:57:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2022-07-12 05:57:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:30,310 INFO L225 Difference]: With dead ends: 845 [2022-07-12 05:57:30,310 INFO L226 Difference]: Without dead ends: 521 [2022-07-12 05:57:30,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-12 05:57:30,314 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 1204 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:30,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1676 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 05:57:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-07-12 05:57:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 353. [2022-07-12 05:57:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 53 states have call successors, (53), 16 states have call predecessors, (53), 20 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2022-07-12 05:57:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 544 transitions. [2022-07-12 05:57:30,342 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 544 transitions. Word has length 117 [2022-07-12 05:57:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:30,343 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 544 transitions. [2022-07-12 05:57:30,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 05:57:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 544 transitions. [2022-07-12 05:57:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 05:57:30,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:30,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:30,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 05:57:30,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1021608935, now seen corresponding path program 1 times [2022-07-12 05:57:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:30,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241743466] [2022-07-12 05:57:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 05:57:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:57:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 05:57:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 05:57:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 05:57:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 05:57:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 05:57:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241743466] [2022-07-12 05:57:30,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241743466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:57:30,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488962753] [2022-07-12 05:57:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:57:30,446 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-12 05:57:30,480 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-12 05:57:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 05:57:30,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:57:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:30,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:57:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:30,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488962753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:57:30,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 05:57:30,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-07-12 05:57:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168503539] [2022-07-12 05:57:30,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 05:57:30,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 05:57:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 05:57:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:57:30,741 INFO L87 Difference]: Start difference. First operand 353 states and 544 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 05:57:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:32,306 INFO L93 Difference]: Finished difference Result 1014 states and 1626 transitions. [2022-07-12 05:57:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:57:32,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 118 [2022-07-12 05:57:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:32,312 INFO L225 Difference]: With dead ends: 1014 [2022-07-12 05:57:32,312 INFO L226 Difference]: Without dead ends: 873 [2022-07-12 05:57:32,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:57:32,313 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 1288 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:32,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1776 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 05:57:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-12 05:57:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 681. [2022-07-12 05:57:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 543 states have (on average 1.5930018416206262) internal successors, (865), 548 states have internal predecessors, (865), 117 states have call successors, (117), 16 states have call predecessors, (117), 20 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2022-07-12 05:57:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1120 transitions. [2022-07-12 05:57:32,370 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1120 transitions. Word has length 118 [2022-07-12 05:57:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:32,370 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 1120 transitions. [2022-07-12 05:57:32,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 05:57:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1120 transitions. [2022-07-12 05:57:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 05:57:32,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:32,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:32,416 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-12 05:57:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:57:32,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1951274134, now seen corresponding path program 1 times [2022-07-12 05:57:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924840359] [2022-07-12 05:57:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:57:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 05:57:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 05:57:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 05:57:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 05:57:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 05:57:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 05:57:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924840359] [2022-07-12 05:57:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924840359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:32,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172616143] [2022-07-12 05:57:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:32,681 INFO L87 Difference]: Start difference. First operand 681 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:33,701 INFO L93 Difference]: Finished difference Result 1795 states and 2997 transitions. [2022-07-12 05:57:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2022-07-12 05:57:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:33,706 INFO L225 Difference]: With dead ends: 1795 [2022-07-12 05:57:33,707 INFO L226 Difference]: Without dead ends: 1182 [2022-07-12 05:57:33,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:33,709 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1097 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:33,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1264 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-07-12 05:57:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1006. [2022-07-12 05:57:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 804 states have (on average 1.6044776119402986) internal successors, (1290), 809 states have internal predecessors, (1290), 181 states have call successors, (181), 16 states have call predecessors, (181), 20 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2022-07-12 05:57:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1683 transitions. [2022-07-12 05:57:33,754 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1683 transitions. Word has length 124 [2022-07-12 05:57:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:33,754 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1683 transitions. [2022-07-12 05:57:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1683 transitions. [2022-07-12 05:57:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 05:57:33,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:33,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:33,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 05:57:33,758 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 681143198, now seen corresponding path program 1 times [2022-07-12 05:57:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331720633] [2022-07-12 05:57:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:57:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 05:57:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 05:57:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 05:57:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 05:57:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 05:57:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 05:57:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331720633] [2022-07-12 05:57:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331720633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:33,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318888743] [2022-07-12 05:57:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:33,827 INFO L87 Difference]: Start difference. First operand 1006 states and 1683 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:34,892 INFO L93 Difference]: Finished difference Result 2575 states and 4346 transitions. [2022-07-12 05:57:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-07-12 05:57:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:34,900 INFO L225 Difference]: With dead ends: 2575 [2022-07-12 05:57:34,900 INFO L226 Difference]: Without dead ends: 1690 [2022-07-12 05:57:34,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:34,904 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1078 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:34,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1224 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-07-12 05:57:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1514. [2022-07-12 05:57:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1217 states have (on average 1.6113393590797043) internal successors, (1961), 1222 states have internal predecessors, (1961), 276 states have call successors, (276), 16 states have call predecessors, (276), 20 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2022-07-12 05:57:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2544 transitions. [2022-07-12 05:57:34,990 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2544 transitions. Word has length 125 [2022-07-12 05:57:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:34,990 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2544 transitions. [2022-07-12 05:57:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2544 transitions. [2022-07-12 05:57:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 05:57:35,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:35,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:35,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 05:57:35,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -64126520, now seen corresponding path program 1 times [2022-07-12 05:57:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:35,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945856213] [2022-07-12 05:57:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 05:57:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:57:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 05:57:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 05:57:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 05:57:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 05:57:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 05:57:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945856213] [2022-07-12 05:57:35,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945856213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:35,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:35,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683480387] [2022-07-12 05:57:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:35,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:35,092 INFO L87 Difference]: Start difference. First operand 1514 states and 2544 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:36,148 INFO L93 Difference]: Finished difference Result 3727 states and 6355 transitions. [2022-07-12 05:57:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2022-07-12 05:57:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:36,158 INFO L225 Difference]: With dead ends: 3727 [2022-07-12 05:57:36,158 INFO L226 Difference]: Without dead ends: 2459 [2022-07-12 05:57:36,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:36,162 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 1068 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:36,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1235 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2022-07-12 05:57:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2283. [2022-07-12 05:57:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 1863 states have (on average 1.6167471819645733) internal successors, (3012), 1868 states have internal predecessors, (3012), 399 states have call successors, (399), 16 states have call predecessors, (399), 20 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2022-07-12 05:57:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3857 transitions. [2022-07-12 05:57:36,247 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3857 transitions. Word has length 126 [2022-07-12 05:57:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:36,248 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 3857 transitions. [2022-07-12 05:57:36,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3857 transitions. [2022-07-12 05:57:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 05:57:36,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:36,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 05:57:36,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash -793686243, now seen corresponding path program 1 times [2022-07-12 05:57:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:36,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402503042] [2022-07-12 05:57:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 05:57:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 05:57:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 05:57:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 05:57:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 05:57:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 05:57:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 05:57:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:36,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402503042] [2022-07-12 05:57:36,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402503042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:36,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:36,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:36,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412538947] [2022-07-12 05:57:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:36,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:36,322 INFO L87 Difference]: Start difference. First operand 2283 states and 3857 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:37,491 INFO L93 Difference]: Finished difference Result 5521 states and 9489 transitions. [2022-07-12 05:57:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2022-07-12 05:57:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:37,507 INFO L225 Difference]: With dead ends: 5521 [2022-07-12 05:57:37,507 INFO L226 Difference]: Without dead ends: 3688 [2022-07-12 05:57:37,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:37,512 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1070 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:37,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1232 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2022-07-12 05:57:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3512. [2022-07-12 05:57:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2913 states have (on average 1.619979402677652) internal successors, (4719), 2918 states have internal predecessors, (4719), 578 states have call successors, (578), 16 states have call predecessors, (578), 20 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2022-07-12 05:57:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5948 transitions. [2022-07-12 05:57:37,743 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5948 transitions. Word has length 127 [2022-07-12 05:57:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 3512 states and 5948 transitions. [2022-07-12 05:57:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5948 transitions. [2022-07-12 05:57:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 05:57:37,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:37,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:37,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 05:57:37,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1926920396, now seen corresponding path program 1 times [2022-07-12 05:57:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:37,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395219699] [2022-07-12 05:57:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 05:57:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 05:57:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 05:57:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:57:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 05:57:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 05:57:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 05:57:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:37,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395219699] [2022-07-12 05:57:37,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395219699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:37,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:37,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348132105] [2022-07-12 05:57:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:37,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:37,857 INFO L87 Difference]: Start difference. First operand 3512 states and 5948 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:39,094 INFO L93 Difference]: Finished difference Result 8469 states and 14636 transitions. [2022-07-12 05:57:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2022-07-12 05:57:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:39,116 INFO L225 Difference]: With dead ends: 8469 [2022-07-12 05:57:39,116 INFO L226 Difference]: Without dead ends: 5719 [2022-07-12 05:57:39,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:39,126 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 1088 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:39,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1254 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2022-07-12 05:57:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5543. [2022-07-12 05:57:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 4568 states have (on average 1.6136164623467601) internal successors, (7371), 4573 states have internal predecessors, (7371), 954 states have call successors, (954), 16 states have call predecessors, (954), 20 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2022-07-12 05:57:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9396 transitions. [2022-07-12 05:57:39,435 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 9396 transitions. Word has length 128 [2022-07-12 05:57:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:39,435 INFO L495 AbstractCegarLoop]: Abstraction has 5543 states and 9396 transitions. [2022-07-12 05:57:39,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 9396 transitions. [2022-07-12 05:57:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 05:57:39,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:39,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 05:57:39,454 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1737890841, now seen corresponding path program 1 times [2022-07-12 05:57:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217104430] [2022-07-12 05:57:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 05:57:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 05:57:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 05:57:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:57:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 05:57:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 05:57:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 05:57:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217104430] [2022-07-12 05:57:39,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217104430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:39,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:39,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:39,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365737845] [2022-07-12 05:57:39,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:39,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:39,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:39,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:39,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:39,532 INFO L87 Difference]: Start difference. First operand 5543 states and 9396 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:40,849 INFO L93 Difference]: Finished difference Result 13806 states and 23857 transitions. [2022-07-12 05:57:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:40,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2022-07-12 05:57:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:40,893 INFO L225 Difference]: With dead ends: 13806 [2022-07-12 05:57:40,893 INFO L226 Difference]: Without dead ends: 9402 [2022-07-12 05:57:40,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:40,905 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 1059 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:40,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1242 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2022-07-12 05:57:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 9226. [2022-07-12 05:57:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9226 states, 7645 states have (on average 1.6111183780248528) internal successors, (12317), 7650 states have internal predecessors, (12317), 1560 states have call successors, (1560), 16 states have call predecessors, (1560), 20 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2022-07-12 05:57:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9226 states to 9226 states and 15632 transitions. [2022-07-12 05:57:41,315 INFO L78 Accepts]: Start accepts. Automaton has 9226 states and 15632 transitions. Word has length 129 [2022-07-12 05:57:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:41,315 INFO L495 AbstractCegarLoop]: Abstraction has 9226 states and 15632 transitions. [2022-07-12 05:57:41,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9226 states and 15632 transitions. [2022-07-12 05:57:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 05:57:41,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:41,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 05:57:41,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 294042718, now seen corresponding path program 1 times [2022-07-12 05:57:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:41,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584659797] [2022-07-12 05:57:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 05:57:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 05:57:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 05:57:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 05:57:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 05:57:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 05:57:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 05:57:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:41,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584659797] [2022-07-12 05:57:41,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584659797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:41,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:41,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066307270] [2022-07-12 05:57:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:41,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:41,408 INFO L87 Difference]: Start difference. First operand 9226 states and 15632 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:42,951 INFO L93 Difference]: Finished difference Result 23990 states and 41403 transitions. [2022-07-12 05:57:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2022-07-12 05:57:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:43,014 INFO L225 Difference]: With dead ends: 23990 [2022-07-12 05:57:43,015 INFO L226 Difference]: Without dead ends: 16355 [2022-07-12 05:57:43,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:43,046 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1041 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:43,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1266 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16355 states. [2022-07-12 05:57:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16355 to 16179. [2022-07-12 05:57:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16179 states, 13395 states have (on average 1.6020156774916015) internal successors, (21459), 13400 states have internal predecessors, (21459), 2763 states have call successors, (2763), 16 states have call predecessors, (2763), 20 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2022-07-12 05:57:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 27324 transitions. [2022-07-12 05:57:43,848 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 27324 transitions. Word has length 130 [2022-07-12 05:57:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:43,848 INFO L495 AbstractCegarLoop]: Abstraction has 16179 states and 27324 transitions. [2022-07-12 05:57:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 27324 transitions. [2022-07-12 05:57:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 05:57:43,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:43,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:43,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 05:57:43,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash -624018824, now seen corresponding path program 1 times [2022-07-12 05:57:43,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:43,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671046385] [2022-07-12 05:57:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:57:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 05:57:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 05:57:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 05:57:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 05:57:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 05:57:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 05:57:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:43,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671046385] [2022-07-12 05:57:43,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671046385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:43,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:43,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314795817] [2022-07-12 05:57:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:43,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:43,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:43,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:43,949 INFO L87 Difference]: Start difference. First operand 16179 states and 27324 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:45,833 INFO L93 Difference]: Finished difference Result 42956 states and 74002 transitions. [2022-07-12 05:57:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2022-07-12 05:57:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:45,933 INFO L225 Difference]: With dead ends: 42956 [2022-07-12 05:57:45,934 INFO L226 Difference]: Without dead ends: 29010 [2022-07-12 05:57:45,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:45,970 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 1060 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:45,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1234 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 05:57:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2022-07-12 05:57:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 28834. [2022-07-12 05:57:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28834 states, 24011 states have (on average 1.5977260422306443) internal successors, (38363), 24016 states have internal predecessors, (38363), 4802 states have call successors, (4802), 16 states have call predecessors, (4802), 20 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2022-07-12 05:57:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28834 states to 28834 states and 48580 transitions. [2022-07-12 05:57:47,469 INFO L78 Accepts]: Start accepts. Automaton has 28834 states and 48580 transitions. Word has length 131 [2022-07-12 05:57:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:47,469 INFO L495 AbstractCegarLoop]: Abstraction has 28834 states and 48580 transitions. [2022-07-12 05:57:47,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28834 states and 48580 transitions. [2022-07-12 05:57:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 05:57:47,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:47,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:47,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 05:57:47,499 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1114295804, now seen corresponding path program 1 times [2022-07-12 05:57:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64265325] [2022-07-12 05:57:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 05:57:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 05:57:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 05:57:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 05:57:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 05:57:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 05:57:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 05:57:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:47,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64265325] [2022-07-12 05:57:47,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64265325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:47,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:47,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591849751] [2022-07-12 05:57:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:47,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:47,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:47,770 INFO L87 Difference]: Start difference. First operand 28834 states and 48580 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:50,565 INFO L93 Difference]: Finished difference Result 78718 states and 134761 transitions. [2022-07-12 05:57:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2022-07-12 05:57:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:50,766 INFO L225 Difference]: With dead ends: 78718 [2022-07-12 05:57:50,766 INFO L226 Difference]: Without dead ends: 52889 [2022-07-12 05:57:50,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:50,836 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 1056 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:50,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1247 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 05:57:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52889 states. [2022-07-12 05:57:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52889 to 52713. [2022-07-12 05:57:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52713 states, 44175 states have (on average 1.5921222410865874) internal successors, (70332), 44180 states have internal predecessors, (70332), 8517 states have call successors, (8517), 16 states have call predecessors, (8517), 20 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2022-07-12 05:57:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52713 states to 52713 states and 88511 transitions. [2022-07-12 05:57:53,199 INFO L78 Accepts]: Start accepts. Automaton has 52713 states and 88511 transitions. Word has length 132 [2022-07-12 05:57:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:53,199 INFO L495 AbstractCegarLoop]: Abstraction has 52713 states and 88511 transitions. [2022-07-12 05:57:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52713 states and 88511 transitions. [2022-07-12 05:57:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 05:57:53,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:53,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:53,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 05:57:53,231 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1436802920, now seen corresponding path program 1 times [2022-07-12 05:57:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:53,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731007255] [2022-07-12 05:57:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:57:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:57:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:57:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 05:57:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 05:57:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 05:57:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 05:57:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 05:57:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 05:57:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 05:57:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:57:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731007255] [2022-07-12 05:57:53,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731007255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:53,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:53,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798673099] [2022-07-12 05:57:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:53,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:53,304 INFO L87 Difference]: Start difference. First operand 52713 states and 88511 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:57:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:57,836 INFO L93 Difference]: Finished difference Result 98489 states and 168948 transitions. [2022-07-12 05:57:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:57,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2022-07-12 05:57:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:58,289 INFO L225 Difference]: With dead ends: 98489 [2022-07-12 05:57:58,289 INFO L226 Difference]: Without dead ends: 98348 [2022-07-12 05:57:58,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:58,344 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 1061 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:58,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1230 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 05:57:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98348 states. [2022-07-12 05:58:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98348 to 98172. [2022-07-12 05:58:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98172 states, 82835 states have (on average 1.585102915434297) internal successors, (131302), 82840 states have internal predecessors, (131302), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2022-07-12 05:58:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98172 states to 98172 states and 164125 transitions. [2022-07-12 05:58:02,824 INFO L78 Accepts]: Start accepts. Automaton has 98172 states and 164125 transitions. Word has length 133 [2022-07-12 05:58:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:58:02,825 INFO L495 AbstractCegarLoop]: Abstraction has 98172 states and 164125 transitions. [2022-07-12 05:58:02,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:58:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98172 states and 164125 transitions. [2022-07-12 05:58:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 05:58:03,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:58:03,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:58:03,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 05:58:03,114 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:58:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:58:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1777075171, now seen corresponding path program 1 times [2022-07-12 05:58:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:58:03,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500351066] [2022-07-12 05:58:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:58:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:58:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:58:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:58:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:58:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:58:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:58:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 05:58:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 05:58:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:58:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 05:58:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 05:58:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 05:58:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 05:58:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 05:58:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:58:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500351066] [2022-07-12 05:58:03,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500351066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:58:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689489436] [2022-07-12 05:58:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:58:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:58:03,280 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-12 05:58:03,281 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-12 05:58:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:03,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 05:58:03,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:58:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 05:58:03,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:58:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 05:58:03,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689489436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:58:03,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 05:58:03,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2022-07-12 05:58:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251421262] [2022-07-12 05:58:03,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 05:58:03,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 05:58:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:58:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 05:58:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-07-12 05:58:03,859 INFO L87 Difference]: Start difference. First operand 98172 states and 164125 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 18 states have internal predecessors, (222), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) [2022-07-12 05:58:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:58:16,430 INFO L93 Difference]: Finished difference Result 197054 states and 340208 transitions. [2022-07-12 05:58:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 05:58:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 18 states have internal predecessors, (222), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) Word has length 134 [2022-07-12 05:58:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:58:17,519 INFO L225 Difference]: With dead ends: 197054 [2022-07-12 05:58:17,519 INFO L226 Difference]: Without dead ends: 196919 [2022-07-12 05:58:17,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=916, Invalid=4196, Unknown=0, NotChecked=0, Total=5112 [2022-07-12 05:58:17,606 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 4143 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 9155 mSolverCounterSat, 1681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 10836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1681 IncrementalHoareTripleChecker+Valid, 9155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:58:17,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 2865 Invalid, 10836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1681 Valid, 9155 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 05:58:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196919 states. [2022-07-12 05:58:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196919 to 196345. [2022-07-12 05:58:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196345 states, 165673 states have (on average 1.5851104283739657) internal successors, (262610), 165680 states have internal predecessors, (262610), 30630 states have call successors, (30630), 34 states have call predecessors, (30630), 41 states have return successors, (37192), 30630 states have call predecessors, (37192), 30628 states have call successors, (37192) [2022-07-12 05:58:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196345 states to 196345 states and 330432 transitions. [2022-07-12 05:58:27,480 INFO L78 Accepts]: Start accepts. Automaton has 196345 states and 330432 transitions. Word has length 134 [2022-07-12 05:58:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:58:27,481 INFO L495 AbstractCegarLoop]: Abstraction has 196345 states and 330432 transitions. [2022-07-12 05:58:27,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 18 states have internal predecessors, (222), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) [2022-07-12 05:58:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 196345 states and 330432 transitions. [2022-07-12 05:58:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 05:58:27,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:58:27,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:58:27,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 05:58:28,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:58:28,180 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:58:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:58:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 602556902, now seen corresponding path program 1 times [2022-07-12 05:58:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:58:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315399231] [2022-07-12 05:58:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:58:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:58:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:58:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:58:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:58:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:58:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:58:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 05:58:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 05:58:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:58:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 05:58:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 05:58:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 05:58:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 05:58:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 05:58:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 05:58:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:58:28,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315399231] [2022-07-12 05:58:28,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315399231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:58:28,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:58:28,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 05:58:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977935663] [2022-07-12 05:58:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:58:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 05:58:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:58:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 05:58:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:58:28,273 INFO L87 Difference]: Start difference. First operand 196345 states and 330432 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)