./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product21.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/elevator_spec3_product21.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 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 05:50:15,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 05:50:15,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 05:50:15,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 05:50:15,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 05:50:15,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 05:50:15,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 05:50:15,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 05:50:15,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 05:50:15,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 05:50:15,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 05:50:15,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 05:50:15,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 05:50:15,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 05:50:15,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 05:50:15,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 05:50:15,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 05:50:15,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 05:50:15,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 05:50:15,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 05:50:15,636 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 05:50:15,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 05:50:15,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 05:50:15,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 05:50:15,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 05:50:15,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 05:50:15,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 05:50:15,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 05:50:15,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 05:50:15,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 05:50:15,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 05:50:15,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 05:50:15,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 05:50:15,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 05:50:15,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 05:50:15,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 05:50:15,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 05:50:15,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 05:50:15,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 05:50:15,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 05:50:15,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 05:50:15,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 05:50:15,656 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:50:15,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 05:50:15,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 05:50:15,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 05:50:15,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 05:50:15,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 05:50:15,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 05:50:15,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 05:50:15,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 05:50:15,679 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 05:50:15,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 05:50:15,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 05:50:15,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 05:50:15,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 05:50:15,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 05:50:15,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 05:50:15,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 05:50:15,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 05:50:15,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 05:50:15,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 05:50:15,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:50:15,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 05:50:15,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 05:50:15,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 05:50:15,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 05:50:15,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 05:50:15,686 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 05:50:15,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 05:50:15,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 05:50:15,686 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 -> 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 [2022-07-12 05:50:15,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 05:50:15,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 05:50:15,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 05:50:15,903 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 05:50:15,903 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 05:50:15,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2022-07-12 05:50:15,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7894c9f/68c3ff5b703d4ea2b213039461d90262/FLAGbfec9ed6f [2022-07-12 05:50:16,427 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 05:50:16,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2022-07-12 05:50:16,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7894c9f/68c3ff5b703d4ea2b213039461d90262/FLAGbfec9ed6f [2022-07-12 05:50:16,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7894c9f/68c3ff5b703d4ea2b213039461d90262 [2022-07-12 05:50:16,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 05:50:16,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 05:50:16,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 05:50:16,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 05:50:16,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 05:50:16,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:50:16" (1/1) ... [2022-07-12 05:50:16,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689db96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:16, skipping insertion in model container [2022-07-12 05:50:16,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:50:16" (1/1) ... [2022-07-12 05:50:16,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 05:50:17,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 05:50:17,399 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/elevator_spec3_product21.cil.c[62420,62433] [2022-07-12 05:50:17,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:50:17,437 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 05:50:17,502 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/elevator_spec3_product21.cil.c[62420,62433] [2022-07-12 05:50:17,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:50:17,535 INFO L208 MainTranslator]: Completed translation [2022-07-12 05:50:17,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17 WrapperNode [2022-07-12 05:50:17,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 05:50:17,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 05:50:17,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 05:50:17,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 05:50:17,543 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:50:17" (1/1) ... [2022-07-12 05:50:17,567 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:50:17" (1/1) ... [2022-07-12 05:50:17,607 INFO L137 Inliner]: procedures = 90, calls = 345, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 884 [2022-07-12 05:50:17,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 05:50:17,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 05:50:17,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 05:50:17,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 05:50:17,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 05:50:17,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 05:50:17,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 05:50:17,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 05:50:17,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (1/1) ... [2022-07-12 05:50:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:50:17,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:50:17,765 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:50:17,768 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:50:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 05:50:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2022-07-12 05:50:17,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2022-07-12 05:50:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-07-12 05:50:17,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-07-12 05:50:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-07-12 05:50:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-07-12 05:50:17,794 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-07-12 05:50:17,794 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-07-12 05:50:17,794 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2022-07-12 05:50:17,795 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2022-07-12 05:50:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-07-12 05:50:17,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-07-12 05:50:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-12 05:50:17,795 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-12 05:50:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-07-12 05:50:17,795 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-07-12 05:50:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-07-12 05:50:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-07-12 05:50:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-07-12 05:50:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-07-12 05:50:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-07-12 05:50:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-07-12 05:50:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-07-12 05:50:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-07-12 05:50:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2022-07-12 05:50:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2022-07-12 05:50:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2022-07-12 05:50:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2022-07-12 05:50:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-07-12 05:50:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-07-12 05:50:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2022-07-12 05:50:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2022-07-12 05:50:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-07-12 05:50:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-07-12 05:50:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-07-12 05:50:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-07-12 05:50:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-07-12 05:50:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-07-12 05:50:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-07-12 05:50:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-07-12 05:50:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 05:50:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2022-07-12 05:50:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2022-07-12 05:50:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-07-12 05:50:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-07-12 05:50:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-07-12 05:50:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-07-12 05:50:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-07-12 05:50:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-07-12 05:50:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2022-07-12 05:50:17,800 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2022-07-12 05:50:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 05:50:17,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 05:50:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-07-12 05:50:17,801 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-07-12 05:50:17,958 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 05:50:17,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 05:50:18,712 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 05:50:18,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 05:50:18,736 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 05:50:18,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:50:18 BoogieIcfgContainer [2022-07-12 05:50:18,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 05:50:18,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 05:50:18,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 05:50:18,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 05:50:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:50:16" (1/3) ... [2022-07-12 05:50:18,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f296282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:50:18, skipping insertion in model container [2022-07-12 05:50:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:50:17" (2/3) ... [2022-07-12 05:50:18,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f296282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:50:18, skipping insertion in model container [2022-07-12 05:50:18,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:50:18" (3/3) ... [2022-07-12 05:50:18,744 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product21.cil.c [2022-07-12 05:50:18,755 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 05:50:18,756 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 05:50:18,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 05:50:18,811 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@6e5c25c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3608da17 [2022-07-12 05:50:18,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 05:50:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 588 states, 454 states have (on average 1.6762114537444934) internal successors, (761), 472 states have internal predecessors, (761), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2022-07-12 05:50:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 05:50:18,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:18,838 INFO L195 NwaCegarLoop]: trace histogram [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:50:18,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -803811748, now seen corresponding path program 1 times [2022-07-12 05:50:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:18,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410170625] [2022-07-12 05:50:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:50:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 05:50:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:50:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:50:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 05:50:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 05:50:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:19,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410170625] [2022-07-12 05:50:19,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410170625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:19,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:19,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554302290] [2022-07-12 05:50:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:19,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:19,656 INFO L87 Difference]: Start difference. First operand has 588 states, 454 states have (on average 1.6762114537444934) internal successors, (761), 472 states have internal predecessors, (761), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:25,943 INFO L93 Difference]: Finished difference Result 1527 states and 2634 transitions. [2022-07-12 05:50:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:50:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2022-07-12 05:50:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:25,972 INFO L225 Difference]: With dead ends: 1527 [2022-07-12 05:50:25,974 INFO L226 Difference]: Without dead ends: 939 [2022-07-12 05:50:25,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:50:25,996 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 2293 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 5358 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 6162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 5358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:25,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 3816 Invalid, 6162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [804 Valid, 5358 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 05:50:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-12 05:50:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 591. [2022-07-12 05:50:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 457 states have (on average 1.6673960612691465) internal successors, (762), 475 states have internal predecessors, (762), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2022-07-12 05:50:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 975 transitions. [2022-07-12 05:50:26,178 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 975 transitions. Word has length 99 [2022-07-12 05:50:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:26,179 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 975 transitions. [2022-07-12 05:50:26,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 975 transitions. [2022-07-12 05:50:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 05:50:26,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:26,185 INFO L195 NwaCegarLoop]: trace histogram [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:50:26,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 05:50:26,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1606711870, now seen corresponding path program 1 times [2022-07-12 05:50:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:26,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234106314] [2022-07-12 05:50:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:50:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:50:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 05:50:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:50:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 05:50:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 05:50:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:26,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:26,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234106314] [2022-07-12 05:50:26,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234106314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:26,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:26,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318157392] [2022-07-12 05:50:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:26,494 INFO L87 Difference]: Start difference. First operand 591 states and 975 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:32,455 INFO L93 Difference]: Finished difference Result 1517 states and 2580 transitions. [2022-07-12 05:50:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:50:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2022-07-12 05:50:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:32,461 INFO L225 Difference]: With dead ends: 1517 [2022-07-12 05:50:32,461 INFO L226 Difference]: Without dead ends: 942 [2022-07-12 05:50:32,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:50:32,470 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 1668 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 5621 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 6195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 5621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:32,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 3611 Invalid, 6195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 5621 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:50:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-07-12 05:50:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 591. [2022-07-12 05:50:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 457 states have (on average 1.6652078774617067) internal successors, (761), 475 states have internal predecessors, (761), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2022-07-12 05:50:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 974 transitions. [2022-07-12 05:50:32,542 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 974 transitions. Word has length 100 [2022-07-12 05:50:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:32,544 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 974 transitions. [2022-07-12 05:50:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 974 transitions. [2022-07-12 05:50:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 05:50:32,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:32,547 INFO L195 NwaCegarLoop]: trace histogram [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:50:32,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 05:50:32,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2010780664, now seen corresponding path program 1 times [2022-07-12 05:50:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:32,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222122748] [2022-07-12 05:50:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:50:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:50:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:50:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 05:50:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:50:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 05:50:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 05:50:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:32,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:32,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222122748] [2022-07-12 05:50:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222122748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:32,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:32,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:50:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298933102] [2022-07-12 05:50:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:50:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:50:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:50:32,872 INFO L87 Difference]: Start difference. First operand 591 states and 974 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 05:50:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:37,450 INFO L93 Difference]: Finished difference Result 1508 states and 2560 transitions. [2022-07-12 05:50:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:50:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2022-07-12 05:50:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:37,456 INFO L225 Difference]: With dead ends: 1508 [2022-07-12 05:50:37,457 INFO L226 Difference]: Without dead ends: 902 [2022-07-12 05:50:37,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:37,461 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 2180 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 797 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:37,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 2138 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [797 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 05:50:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-07-12 05:50:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 567. [2022-07-12 05:50:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 436 states have (on average 1.6559633027522935) internal successors, (722), 452 states have internal predecessors, (722), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:50:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 931 transitions. [2022-07-12 05:50:37,529 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 931 transitions. Word has length 100 [2022-07-12 05:50:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:37,529 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 931 transitions. [2022-07-12 05:50:37,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 05:50:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 931 transitions. [2022-07-12 05:50:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 05:50:37,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:37,541 INFO L195 NwaCegarLoop]: trace histogram [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:50:37,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 05:50:37,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1736673176, now seen corresponding path program 1 times [2022-07-12 05:50:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421827128] [2022-07-12 05:50:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:50:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 05:50:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:50:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:50:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 05:50:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 05:50:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:37,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421827128] [2022-07-12 05:50:37,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421827128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:37,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:37,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202427280] [2022-07-12 05:50:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:37,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:37,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:37,865 INFO L87 Difference]: Start difference. First operand 567 states and 931 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:43,050 INFO L93 Difference]: Finished difference Result 1471 states and 2491 transitions. [2022-07-12 05:50:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:50:43,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2022-07-12 05:50:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:43,055 INFO L225 Difference]: With dead ends: 1471 [2022-07-12 05:50:43,055 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 05:50:43,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:50:43,059 INFO L413 NwaCegarLoop]: 939 mSDtfsCounter, 1663 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 5818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:43,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 3645 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 05:50:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 05:50:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 561. [2022-07-12 05:50:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 430 states have (on average 1.6488372093023256) internal successors, (709), 446 states have internal predecessors, (709), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:50:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 918 transitions. [2022-07-12 05:50:43,123 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 918 transitions. Word has length 101 [2022-07-12 05:50:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:43,123 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 918 transitions. [2022-07-12 05:50:43,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 918 transitions. [2022-07-12 05:50:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 05:50:43,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:43,126 INFO L195 NwaCegarLoop]: trace histogram [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:50:43,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 05:50:43,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1439435094, now seen corresponding path program 1 times [2022-07-12 05:50:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:43,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286917290] [2022-07-12 05:50:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 05:50:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:50:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:50:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 05:50:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 05:50:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 05:50:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:43,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286917290] [2022-07-12 05:50:43,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286917290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:43,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:43,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122072938] [2022-07-12 05:50:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:43,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:43,421 INFO L87 Difference]: Start difference. First operand 561 states and 918 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:48,679 INFO L93 Difference]: Finished difference Result 1441 states and 2440 transitions. [2022-07-12 05:50:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:50:48,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2022-07-12 05:50:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:48,684 INFO L225 Difference]: With dead ends: 1441 [2022-07-12 05:50:48,684 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 05:50:48,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:50:48,688 INFO L413 NwaCegarLoop]: 900 mSDtfsCounter, 2106 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 5122 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 3552 SdHoareTripleChecker+Invalid, 5911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 5122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 3552 Invalid, 5911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 5122 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 05:50:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 05:50:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 561. [2022-07-12 05:50:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 430 states have (on average 1.6465116279069767) internal successors, (708), 446 states have internal predecessors, (708), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:50:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 917 transitions. [2022-07-12 05:50:48,741 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 917 transitions. Word has length 102 [2022-07-12 05:50:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:48,742 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 917 transitions. [2022-07-12 05:50:48,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 917 transitions. [2022-07-12 05:50:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 05:50:48,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:48,744 INFO L195 NwaCegarLoop]: trace histogram [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:50:48,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 05:50:48,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1030530245, now seen corresponding path program 1 times [2022-07-12 05:50:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:48,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156791948] [2022-07-12 05:50:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 05:50:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 05:50:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 05:50:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 05:50:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 05:50:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 05:50:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:49,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156791948] [2022-07-12 05:50:49,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156791948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:49,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:49,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320311763] [2022-07-12 05:50:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:49,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:49,092 INFO L87 Difference]: Start difference. First operand 561 states and 917 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:50:54,760 INFO L93 Difference]: Finished difference Result 1459 states and 2460 transitions. [2022-07-12 05:50:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:50:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2022-07-12 05:50:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:50:54,768 INFO L225 Difference]: With dead ends: 1459 [2022-07-12 05:50:54,768 INFO L226 Difference]: Without dead ends: 890 [2022-07-12 05:50:54,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:50:54,779 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1093 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 5367 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 3671 SdHoareTripleChecker+Invalid, 5712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 5367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:50:54,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 3671 Invalid, 5712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 5367 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:50:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2022-07-12 05:50:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 555. [2022-07-12 05:50:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 424 states have (on average 1.6391509433962264) internal successors, (695), 440 states have internal predecessors, (695), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:50:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 904 transitions. [2022-07-12 05:50:54,872 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 904 transitions. Word has length 103 [2022-07-12 05:50:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:50:54,873 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 904 transitions. [2022-07-12 05:50:54,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:50:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 904 transitions. [2022-07-12 05:50:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 05:50:54,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:50:54,875 INFO L195 NwaCegarLoop]: trace histogram [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:50:54,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 05:50:54,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:50:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:50:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -610304852, now seen corresponding path program 1 times [2022-07-12 05:50:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:50:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373735475] [2022-07-12 05:50:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:50:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:50:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:50:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:50:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:50:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 05:50:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 05:50:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:50:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 05:50:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:50:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 05:50:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 05:50:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:50:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:50:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:50:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373735475] [2022-07-12 05:50:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373735475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:50:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:50:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:50:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272610701] [2022-07-12 05:50:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:50:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:50:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:50:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:50:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:50:55,173 INFO L87 Difference]: Start difference. First operand 555 states and 904 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:00,820 INFO L93 Difference]: Finished difference Result 1429 states and 2411 transitions. [2022-07-12 05:51:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:51:00,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2022-07-12 05:51:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:00,826 INFO L225 Difference]: With dead ends: 1429 [2022-07-12 05:51:00,827 INFO L226 Difference]: Without dead ends: 890 [2022-07-12 05:51:00,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:51:00,830 INFO L413 NwaCegarLoop]: 880 mSDtfsCounter, 1037 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 5218 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 5571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 5218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:00,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 3580 Invalid, 5571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 5218 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 05:51:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2022-07-12 05:51:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 555. [2022-07-12 05:51:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 424 states have (on average 1.6367924528301887) internal successors, (694), 440 states have internal predecessors, (694), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:51:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 903 transitions. [2022-07-12 05:51:00,914 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 903 transitions. Word has length 104 [2022-07-12 05:51:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:00,914 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 903 transitions. [2022-07-12 05:51:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 903 transitions. [2022-07-12 05:51:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:51:00,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:00,917 INFO L195 NwaCegarLoop]: trace histogram [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:51:00,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 05:51:00,917 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1454612664, now seen corresponding path program 1 times [2022-07-12 05:51:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:00,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716968588] [2022-07-12 05:51:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:51:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 05:51:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 05:51:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 05:51:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 05:51:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:51:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:01,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716968588] [2022-07-12 05:51:01,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716968588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:01,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:01,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:51:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931745887] [2022-07-12 05:51:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:01,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:51:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:51:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:01,257 INFO L87 Difference]: Start difference. First operand 555 states and 903 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:06,653 INFO L93 Difference]: Finished difference Result 1450 states and 2433 transitions. [2022-07-12 05:51:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:51:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2022-07-12 05:51:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:06,657 INFO L225 Difference]: With dead ends: 1450 [2022-07-12 05:51:06,657 INFO L226 Difference]: Without dead ends: 911 [2022-07-12 05:51:06,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:51:06,660 INFO L413 NwaCegarLoop]: 892 mSDtfsCounter, 2082 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 5077 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3544 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 5077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:06,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3544 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 5077 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 05:51:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-12 05:51:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 560. [2022-07-12 05:51:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 429 states have (on average 1.6293706293706294) internal successors, (699), 445 states have internal predecessors, (699), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:51:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 908 transitions. [2022-07-12 05:51:06,741 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 908 transitions. Word has length 105 [2022-07-12 05:51:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:06,742 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 908 transitions. [2022-07-12 05:51:06,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 908 transitions. [2022-07-12 05:51:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:51:06,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:06,744 INFO L195 NwaCegarLoop]: trace histogram [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:51:06,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 05:51:06,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2068554199, now seen corresponding path program 1 times [2022-07-12 05:51:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:06,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469863063] [2022-07-12 05:51:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:51:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 05:51:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 05:51:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 05:51:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 05:51:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:51:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:07,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469863063] [2022-07-12 05:51:07,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469863063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:07,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:07,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:51:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331264286] [2022-07-12 05:51:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:07,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:51:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:51:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:07,043 INFO L87 Difference]: Start difference. First operand 560 states and 908 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:12,107 INFO L93 Difference]: Finished difference Result 1452 states and 2432 transitions. [2022-07-12 05:51:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:51:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2022-07-12 05:51:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:12,111 INFO L225 Difference]: With dead ends: 1452 [2022-07-12 05:51:12,111 INFO L226 Difference]: Without dead ends: 884 [2022-07-12 05:51:12,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:51:12,113 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 2137 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 5016 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 3403 SdHoareTripleChecker+Invalid, 5816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 5016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:12,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2247 Valid, 3403 Invalid, 5816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 5016 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 05:51:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-07-12 05:51:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 549. [2022-07-12 05:51:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 418 states have (on average 1.6267942583732058) internal successors, (680), 434 states have internal predecessors, (680), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:51:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 889 transitions. [2022-07-12 05:51:12,191 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 889 transitions. Word has length 105 [2022-07-12 05:51:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:12,191 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 889 transitions. [2022-07-12 05:51:12,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 889 transitions. [2022-07-12 05:51:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:51:12,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:12,193 INFO L195 NwaCegarLoop]: trace histogram [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:51:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 05:51:12,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 18239601, now seen corresponding path program 1 times [2022-07-12 05:51:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219601758] [2022-07-12 05:51:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 05:51:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:51:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 05:51:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 05:51:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 05:51:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:51:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:12,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219601758] [2022-07-12 05:51:12,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219601758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:12,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:12,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:51:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877406586] [2022-07-12 05:51:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:51:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:51:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:12,458 INFO L87 Difference]: Start difference. First operand 549 states and 889 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:17,698 INFO L93 Difference]: Finished difference Result 1429 states and 2392 transitions. [2022-07-12 05:51:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:51:17,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2022-07-12 05:51:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:17,701 INFO L225 Difference]: With dead ends: 1429 [2022-07-12 05:51:17,702 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 05:51:17,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:51:17,704 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 1542 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 4988 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 3403 SdHoareTripleChecker+Invalid, 5566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 4988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:17,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 3403 Invalid, 5566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 4988 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 05:51:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 05:51:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 555. [2022-07-12 05:51:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 424 states have (on average 1.6179245283018868) internal successors, (686), 440 states have internal predecessors, (686), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:51:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 895 transitions. [2022-07-12 05:51:17,774 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 895 transitions. Word has length 106 [2022-07-12 05:51:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 895 transitions. [2022-07-12 05:51:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 895 transitions. [2022-07-12 05:51:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:51:17,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:17,776 INFO L195 NwaCegarLoop]: trace histogram [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:51:17,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 05:51:17,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash -949111053, now seen corresponding path program 1 times [2022-07-12 05:51:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180783266] [2022-07-12 05:51:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 05:51:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:51:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 05:51:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 05:51:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 05:51:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 05:51:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180783266] [2022-07-12 05:51:18,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180783266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:18,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:18,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:51:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628799433] [2022-07-12 05:51:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:18,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:51:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:51:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:18,056 INFO L87 Difference]: Start difference. First operand 555 states and 895 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:23,399 INFO L93 Difference]: Finished difference Result 1432 states and 2393 transitions. [2022-07-12 05:51:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 05:51:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2022-07-12 05:51:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:23,403 INFO L225 Difference]: With dead ends: 1432 [2022-07-12 05:51:23,404 INFO L226 Difference]: Without dead ends: 884 [2022-07-12 05:51:23,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-12 05:51:23,406 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 1002 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 5137 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 3589 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 5137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:23,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 3589 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 5137 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 05:51:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-07-12 05:51:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 549. [2022-07-12 05:51:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 418 states have (on average 1.624401913875598) internal successors, (679), 434 states have internal predecessors, (679), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2022-07-12 05:51:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 888 transitions. [2022-07-12 05:51:23,480 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 888 transitions. Word has length 106 [2022-07-12 05:51:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:23,480 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 888 transitions. [2022-07-12 05:51:23,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:51:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 888 transitions. [2022-07-12 05:51:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 05:51:23,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:23,482 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 05:51:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 05:51:23,483 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 265194798, now seen corresponding path program 1 times [2022-07-12 05:51:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910260883] [2022-07-12 05:51:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:51:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:51:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:51:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:51:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 05:51:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 05:51:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910260883] [2022-07-12 05:51:23,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910260883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:23,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:23,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:51:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225597068] [2022-07-12 05:51:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:23,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:51:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:23,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:51:23,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:51:23,747 INFO L87 Difference]: Start difference. First operand 549 states and 888 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:51:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:33,077 INFO L93 Difference]: Finished difference Result 2160 states and 3663 transitions. [2022-07-12 05:51:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 05:51:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2022-07-12 05:51:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:33,088 INFO L225 Difference]: With dead ends: 2160 [2022-07-12 05:51:33,088 INFO L226 Difference]: Without dead ends: 1629 [2022-07-12 05:51:33,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:51:33,092 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2493 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 5936 mSolverCounterSat, 1208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 7144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1208 IncrementalHoareTripleChecker+Valid, 5936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:33,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 3371 Invalid, 7144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1208 Valid, 5936 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 05:51:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-07-12 05:51:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1029. [2022-07-12 05:51:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 786 states have (on average 1.5877862595419847) internal successors, (1248), 816 states have internal predecessors, (1248), 196 states have call successors, (196), 49 states have call predecessors, (196), 46 states have return successors, (197), 188 states have call predecessors, (197), 192 states have call successors, (197) [2022-07-12 05:51:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1641 transitions. [2022-07-12 05:51:33,294 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1641 transitions. Word has length 107 [2022-07-12 05:51:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:33,294 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1641 transitions. [2022-07-12 05:51:33,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:51:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1641 transitions. [2022-07-12 05:51:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 05:51:33,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:33,296 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 05:51:33,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 05:51:33,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 143661809, now seen corresponding path program 1 times [2022-07-12 05:51:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996596854] [2022-07-12 05:51:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:51:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:51:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:51:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:51:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:51:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 05:51:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 05:51:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 05:51:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:33,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996596854] [2022-07-12 05:51:33,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996596854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:51:33,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251058702] [2022-07-12 05:51:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:51:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:51:33,606 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:51:33,625 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:51:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:33,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 05:51:33,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:51:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:51:33,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:51:33,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251058702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:33,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:51:33,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 05:51:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337319719] [2022-07-12 05:51:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:33,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:51:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:51:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:33,956 INFO L87 Difference]: Start difference. First operand 1029 states and 1641 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 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:51:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:34,370 INFO L93 Difference]: Finished difference Result 2959 states and 4785 transitions. [2022-07-12 05:51:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:51:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 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 112 [2022-07-12 05:51:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:34,378 INFO L225 Difference]: With dead ends: 2959 [2022-07-12 05:51:34,378 INFO L226 Difference]: Without dead ends: 1948 [2022-07-12 05:51:34,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:34,383 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 815 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:34,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1813 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:51:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-07-12 05:51:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1887. [2022-07-12 05:51:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1450 states have (on average 1.6055172413793104) internal successors, (2328), 1510 states have internal predecessors, (2328), 349 states have call successors, (349), 88 states have call predecessors, (349), 87 states have return successors, (364), 338 states have call predecessors, (364), 345 states have call successors, (364) [2022-07-12 05:51:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 3041 transitions. [2022-07-12 05:51:34,706 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 3041 transitions. Word has length 112 [2022-07-12 05:51:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:34,706 INFO L495 AbstractCegarLoop]: Abstraction has 1887 states and 3041 transitions. [2022-07-12 05:51:34,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 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:51:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 3041 transitions. [2022-07-12 05:51:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 05:51:34,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:34,709 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 05:51:34,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 05:51:34,923 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,SelfDestructingSolverStorable12 [2022-07-12 05:51:34,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash -596198869, now seen corresponding path program 1 times [2022-07-12 05:51:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:34,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568250520] [2022-07-12 05:51:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:51:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:51:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:51:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:51:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 05:51:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:51:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 05:51:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 05:51:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 05:51:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568250520] [2022-07-12 05:51:35,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568250520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:51:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390409878] [2022-07-12 05:51:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:51:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:51:35,272 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:51:35,350 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:51:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:35,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 05:51:35,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:51:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:51:35,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:51:35,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390409878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:35,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:51:35,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 05:51:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018006472] [2022-07-12 05:51:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:35,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:51:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:51:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:35,685 INFO L87 Difference]: Start difference. First operand 1887 states and 3041 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 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:51:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:36,144 INFO L93 Difference]: Finished difference Result 4227 states and 6851 transitions. [2022-07-12 05:51:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:51:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 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:51:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:36,155 INFO L225 Difference]: With dead ends: 4227 [2022-07-12 05:51:36,155 INFO L226 Difference]: Without dead ends: 2358 [2022-07-12 05:51:36,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:51:36,163 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 813 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:36,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:51:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2022-07-12 05:51:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2311. [2022-07-12 05:51:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 1779 states have (on average 1.6172006745362564) internal successors, (2877), 1854 states have internal predecessors, (2877), 425 states have call successors, (425), 106 states have call predecessors, (425), 106 states have return successors, (444), 413 states have call predecessors, (444), 421 states have call successors, (444) [2022-07-12 05:51:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3746 transitions. [2022-07-12 05:51:36,554 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3746 transitions. Word has length 113 [2022-07-12 05:51:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:36,554 INFO L495 AbstractCegarLoop]: Abstraction has 2311 states and 3746 transitions. [2022-07-12 05:51:36,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 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:51:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3746 transitions. [2022-07-12 05:51:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 05:51:36,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:36,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:51:36,579 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:51:36,771 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,SelfDestructingSolverStorable13 [2022-07-12 05:51:36,771 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 426526902, now seen corresponding path program 1 times [2022-07-12 05:51:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903398463] [2022-07-12 05:51:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:51:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:51:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:51:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:51:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 05:51:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 05:51:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:51:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 05:51:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 05:51:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:37,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903398463] [2022-07-12 05:51:37,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903398463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:37,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:37,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:51:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989234213] [2022-07-12 05:51:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:37,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:51:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:37,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:51:37,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:51:37,061 INFO L87 Difference]: Start difference. First operand 2311 states and 3746 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:51:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:51:54,838 INFO L93 Difference]: Finished difference Result 11585 states and 21020 transitions. [2022-07-12 05:51:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 05:51:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2022-07-12 05:51:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:51:54,894 INFO L225 Difference]: With dead ends: 11585 [2022-07-12 05:51:54,894 INFO L226 Difference]: Without dead ends: 9292 [2022-07-12 05:51:54,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2022-07-12 05:51:54,911 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 2900 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 8662 mSolverCounterSat, 2003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3018 SdHoareTripleChecker+Valid, 4418 SdHoareTripleChecker+Invalid, 10665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2003 IncrementalHoareTripleChecker+Valid, 8662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:51:54,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3018 Valid, 4418 Invalid, 10665 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2003 Valid, 8662 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-07-12 05:51:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9292 states. [2022-07-12 05:51:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9292 to 5551. [2022-07-12 05:51:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5551 states, 4015 states have (on average 1.5825653798256538) internal successors, (6354), 4320 states have internal predecessors, (6354), 1266 states have call successors, (1266), 206 states have call predecessors, (1266), 269 states have return successors, (2000), 1260 states have call predecessors, (2000), 1260 states have call successors, (2000) [2022-07-12 05:51:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 9620 transitions. [2022-07-12 05:51:56,495 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 9620 transitions. Word has length 116 [2022-07-12 05:51:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:51:56,495 INFO L495 AbstractCegarLoop]: Abstraction has 5551 states and 9620 transitions. [2022-07-12 05:51:56,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:51:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 9620 transitions. [2022-07-12 05:51:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 05:51:56,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:51:56,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:51:56,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 05:51:56,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:51:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:51:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 142406737, now seen corresponding path program 1 times [2022-07-12 05:51:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:51:56,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575688613] [2022-07-12 05:51:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:51:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:51:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:51:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:51:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:51:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:51:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:51:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:51:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:51:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 05:51:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 05:51:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:51:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 05:51:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 05:51:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:51:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:51:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:51:56,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575688613] [2022-07-12 05:51:56,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575688613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:51:56,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:51:56,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:51:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719228664] [2022-07-12 05:51:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:51:56,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:51:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:51:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:51:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:51:56,752 INFO L87 Difference]: Start difference. First operand 5551 states and 9620 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:52:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:52:02,775 INFO L93 Difference]: Finished difference Result 12543 states and 22225 transitions. [2022-07-12 05:52:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:52:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2022-07-12 05:52:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:52:02,814 INFO L225 Difference]: With dead ends: 12543 [2022-07-12 05:52:02,815 INFO L226 Difference]: Without dead ends: 7010 [2022-07-12 05:52:02,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:52:02,894 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 1462 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:52:02,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2180 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 05:52:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7010 states. [2022-07-12 05:52:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7010 to 5559. [2022-07-12 05:52:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 4021 states have (on average 1.5811987067893558) internal successors, (6358), 4326 states have internal predecessors, (6358), 1266 states have call successors, (1266), 210 states have call predecessors, (1266), 271 states have return successors, (1990), 1258 states have call predecessors, (1990), 1260 states have call successors, (1990) [2022-07-12 05:52:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9614 transitions. [2022-07-12 05:52:04,290 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9614 transitions. Word has length 117 [2022-07-12 05:52:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:52:04,290 INFO L495 AbstractCegarLoop]: Abstraction has 5559 states and 9614 transitions. [2022-07-12 05:52:04,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:52:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9614 transitions. [2022-07-12 05:52:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 05:52:04,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:52:04,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:52:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 05:52:04,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:52:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:52:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 313123905, now seen corresponding path program 1 times [2022-07-12 05:52:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:52:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192237624] [2022-07-12 05:52:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:52:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:52:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:52:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:52:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:52:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:52:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:52:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 05:52:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 05:52:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:52:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:52:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 05:52:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 05:52:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 05:52:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:52:04,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192237624] [2022-07-12 05:52:04,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192237624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:52:04,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:52:04,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 05:52:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368120380] [2022-07-12 05:52:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:52:04,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 05:52:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:52:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 05:52:04,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:52:04,628 INFO L87 Difference]: Start difference. First operand 5559 states and 9614 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 05:52:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:52:27,414 INFO L93 Difference]: Finished difference Result 24105 states and 45784 transitions. [2022-07-12 05:52:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 05:52:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2022-07-12 05:52:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:52:27,520 INFO L225 Difference]: With dead ends: 24105 [2022-07-12 05:52:27,520 INFO L226 Difference]: Without dead ends: 18564 [2022-07-12 05:52:27,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2022-07-12 05:52:27,564 INFO L413 NwaCegarLoop]: 1255 mSDtfsCounter, 2943 mSDsluCounter, 4996 mSDsCounter, 0 mSdLazyCounter, 11912 mSolverCounterSat, 2073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 6251 SdHoareTripleChecker+Invalid, 13985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2073 IncrementalHoareTripleChecker+Valid, 11912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:52:27,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 6251 Invalid, 13985 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2073 Valid, 11912 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-07-12 05:52:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18564 states. [2022-07-12 05:52:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18564 to 11069. [2022-07-12 05:52:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11069 states, 8020 states have (on average 1.5740648379052369) internal successors, (12624), 8625 states have internal predecessors, (12624), 2498 states have call successors, (2498), 414 states have call predecessors, (2498), 550 states have return successors, (4361), 2492 states have call predecessors, (4361), 2488 states have call successors, (4361) [2022-07-12 05:52:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11069 states to 11069 states and 19483 transitions. [2022-07-12 05:52:30,794 INFO L78 Accepts]: Start accepts. Automaton has 11069 states and 19483 transitions. Word has length 126 [2022-07-12 05:52:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:52:30,795 INFO L495 AbstractCegarLoop]: Abstraction has 11069 states and 19483 transitions. [2022-07-12 05:52:30,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 05:52:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 11069 states and 19483 transitions. [2022-07-12 05:52:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 05:52:30,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:52:30,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:52:30,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 05:52:30,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:52:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:52:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 287034073, now seen corresponding path program 1 times [2022-07-12 05:52:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:52:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376961618] [2022-07-12 05:52:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:52:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:52:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:52:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:52:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:52:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:52:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:52:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 05:52:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 05:52:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:52:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:52:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 05:52:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 05:52:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 05:52:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:52:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376961618] [2022-07-12 05:52:31,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376961618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:52:31,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:52:31,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:52:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930235361] [2022-07-12 05:52:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:52:31,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:52:31,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:52:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:52:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:52:31,049 INFO L87 Difference]: Start difference. First operand 11069 states and 19483 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 05:52:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:52:39,797 INFO L93 Difference]: Finished difference Result 24855 states and 45484 transitions. [2022-07-12 05:52:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:52:39,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2022-07-12 05:52:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:52:39,888 INFO L225 Difference]: With dead ends: 24855 [2022-07-12 05:52:39,888 INFO L226 Difference]: Without dead ends: 13804 [2022-07-12 05:52:39,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:52:39,990 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 988 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:52:39,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2178 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 05:52:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2022-07-12 05:52:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 11109. [2022-07-12 05:52:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11109 states, 8056 states have (on average 1.5719960278053624) internal successors, (12664), 8653 states have internal predecessors, (12664), 2498 states have call successors, (2498), 430 states have call predecessors, (2498), 554 states have return successors, (4347), 2488 states have call predecessors, (4347), 2488 states have call successors, (4347) [2022-07-12 05:52:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11109 states to 11109 states and 19509 transitions. [2022-07-12 05:52:43,259 INFO L78 Accepts]: Start accepts. Automaton has 11109 states and 19509 transitions. Word has length 127 [2022-07-12 05:52:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:52:43,260 INFO L495 AbstractCegarLoop]: Abstraction has 11109 states and 19509 transitions. [2022-07-12 05:52:43,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 05:52:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11109 states and 19509 transitions. [2022-07-12 05:52:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 05:52:43,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:52:43,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:52:43,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 05:52:43,266 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:52:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:52:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -321888826, now seen corresponding path program 1 times [2022-07-12 05:52:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:52:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504246319] [2022-07-12 05:52:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:52:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:52:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:52:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:52:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:52:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:52:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:52:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:52:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:52:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 05:52:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 05:52:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:52:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:52:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 05:52:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 05:52:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:52:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:52:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:52:43,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504246319] [2022-07-12 05:52:43,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504246319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:52:43,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:52:43,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:52:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566654181] [2022-07-12 05:52:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:52:43,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:52:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:52:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:52:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:52:43,543 INFO L87 Difference]: Start difference. First operand 11109 states and 19509 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 05:53:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:53:13,952 INFO L93 Difference]: Finished difference Result 48096 states and 96029 transitions. [2022-07-12 05:53:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 05:53:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2022-07-12 05:53:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:53:14,214 INFO L225 Difference]: With dead ends: 48096 [2022-07-12 05:53:14,214 INFO L226 Difference]: Without dead ends: 37005 [2022-07-12 05:53:14,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2022-07-12 05:53:14,302 INFO L413 NwaCegarLoop]: 1241 mSDtfsCounter, 2883 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 8682 mSolverCounterSat, 2018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3001 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 10700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2018 IncrementalHoareTripleChecker+Valid, 8682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:53:14,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3001 Valid, 4424 Invalid, 10700 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2018 Valid, 8682 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2022-07-12 05:53:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37005 states. [2022-07-12 05:53:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37005 to 22152. [2022-07-12 05:53:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22152 states, 16064 states have (on average 1.5687873505976095) internal successors, (25201), 17253 states have internal predecessors, (25201), 4973 states have call successors, (4973), 854 states have call predecessors, (4973), 1114 states have return successors, (9703), 4967 states have call predecessors, (9703), 4955 states have call successors, (9703) [2022-07-12 05:53:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22152 states to 22152 states and 39877 transitions. [2022-07-12 05:53:21,316 INFO L78 Accepts]: Start accepts. Automaton has 22152 states and 39877 transitions. Word has length 137 [2022-07-12 05:53:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:53:21,316 INFO L495 AbstractCegarLoop]: Abstraction has 22152 states and 39877 transitions. [2022-07-12 05:53:21,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 05:53:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 22152 states and 39877 transitions. [2022-07-12 05:53:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 05:53:21,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:53:21,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:53:21,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 05:53:21,323 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:53:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:53:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1583803881, now seen corresponding path program 1 times [2022-07-12 05:53:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:53:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587597413] [2022-07-12 05:53:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:53:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:53:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:53:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:53:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:53:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:53:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:53:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:53:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:53:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:53:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:53:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:53:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 05:53:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 05:53:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:53:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:53:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 05:53:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 05:53:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 05:53:21,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:53:21,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587597413] [2022-07-12 05:53:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587597413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:53:21,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:53:21,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:53:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978232815] [2022-07-12 05:53:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:53:21,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:53:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:53:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:53:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:53:21,579 INFO L87 Difference]: Start difference. First operand 22152 states and 39877 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 05:53:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:53:35,342 INFO L93 Difference]: Finished difference Result 49661 states and 95160 transitions. [2022-07-12 05:53:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:53:35,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2022-07-12 05:53:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:53:35,477 INFO L225 Difference]: With dead ends: 49661 [2022-07-12 05:53:35,477 INFO L226 Difference]: Without dead ends: 27527 [2022-07-12 05:53:35,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:53:35,619 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 2028 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:53:35,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 2067 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 05:53:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27527 states. [2022-07-12 05:53:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27527 to 22232. [2022-07-12 05:53:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22232 states, 16136 states have (on average 1.5667451660882499) internal successors, (25281), 17325 states have internal predecessors, (25281), 4973 states have call successors, (4973), 870 states have call predecessors, (4973), 1122 states have return successors, (9687), 4959 states have call predecessors, (9687), 4955 states have call successors, (9687) [2022-07-12 05:53:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22232 states to 22232 states and 39941 transitions. [2022-07-12 05:53:42,429 INFO L78 Accepts]: Start accepts. Automaton has 22232 states and 39941 transitions. Word has length 139 [2022-07-12 05:53:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:53:42,430 INFO L495 AbstractCegarLoop]: Abstraction has 22232 states and 39941 transitions. [2022-07-12 05:53:42,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 05:53:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22232 states and 39941 transitions. [2022-07-12 05:53:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 05:53:42,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:53:42,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:53:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 05:53:42,436 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:53:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:53:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 878265718, now seen corresponding path program 1 times [2022-07-12 05:53:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:53:42,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922085356] [2022-07-12 05:53:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:53:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:53:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:53:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:53:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:53:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:53:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:53:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:53:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:53:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:53:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:53:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 05:53:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 05:53:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 05:53:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 05:53:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:53:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:53:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 05:53:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 05:53:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:53:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 05:53:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:53:42,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922085356] [2022-07-12 05:53:42,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922085356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:53:42,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:53:42,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:53:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844328296] [2022-07-12 05:53:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:53:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:53:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:53:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:53:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:53:42,713 INFO L87 Difference]: Start difference. First operand 22232 states and 39941 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17)