./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc --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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:52:24,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:24,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:24,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:24,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:24,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:24,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:24,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:24,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:24,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:24,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:24,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:24,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:24,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:24,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:24,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:24,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:24,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:24,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:24,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:24,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:24,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:24,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:24,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:24,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:24,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:24,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:24,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:24,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:24,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:24,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:24,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:24,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:24,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:24,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:24,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:24,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:24,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:24,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:24,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:24,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:24,652 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:52:24,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:24,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:24,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:24,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:24,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:24,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:24,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:24,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:24,700 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:24,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:24,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:24,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:24,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:24,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:24,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:52:24,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:24,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:52:24,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:24,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:24,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:24,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:52:24,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:24,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:24,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:24,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:24,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:24,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:24,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:52:24,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:24,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:24,706 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:52:24,707 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:52:24,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:52:24,707 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc 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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2022-11-02 20:52:24,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:24,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:24,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:24,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:24,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:25,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-11-02 20:52:25,065 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/data/10da566c7/eefe1dbe27384023a7f49187278ae468/FLAGc1ee84cbf [2022-11-02 20:52:25,654 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:25,658 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-11-02 20:52:25,679 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/data/10da566c7/eefe1dbe27384023a7f49187278ae468/FLAGc1ee84cbf [2022-11-02 20:52:25,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/data/10da566c7/eefe1dbe27384023a7f49187278ae468 [2022-11-02 20:52:25,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:25,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:25,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:25,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:25,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:25,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:25" (1/1) ... [2022-11-02 20:52:25,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa422b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:25, skipping insertion in model container [2022-11-02 20:52:25,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:25" (1/1) ... [2022-11-02 20:52:25,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:26,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:26,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-11-02 20:52:26,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:26,394 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:26,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-11-02 20:52:26,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:26,479 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:26,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26 WrapperNode [2022-11-02 20:52:26,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:26,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:26,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:26,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:26,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,595 INFO L138 Inliner]: procedures = 38, calls = 62, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 916 [2022-11-02 20:52:26,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:26,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:26,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:26,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:26,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,670 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:26,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:26,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:26,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:26,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (1/1) ... [2022-11-02 20:52:26,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:26,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:26,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df2a3b8-a2e8-4815-8767-7566b95f8f4c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-02 20:52:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-02 20:52:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:52:26,789 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:52:26,789 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:52:26,789 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:52:26,791 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:52:26,792 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:52:26,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:26,792 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:52:26,792 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:52:26,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:26,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:27,031 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:27,033 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:27,058 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,165 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:52:27,165 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:52:27,166 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,190 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-02 20:52:27,190 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-02 20:52:27,211 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,233 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,239 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,245 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,250 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,254 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,257 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,259 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,287 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,843 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2022-11-02 20:52:27,843 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume !false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2022-11-02 20:52:27,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##109: assume false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##110: assume !false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##119: assume !false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##122: assume false; [2022-11-02 20:52:27,845 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume !false; [2022-11-02 20:52:27,847 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:27,880 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:52:27,881 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:52:27,888 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:27,897 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:27,897 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:52:27,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:27 BoogieIcfgContainer [2022-11-02 20:52:27,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:27,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:27,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:27,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:27,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:25" (1/3) ... [2022-11-02 20:52:27,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743884e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:27, skipping insertion in model container [2022-11-02 20:52:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:26" (2/3) ... [2022-11-02 20:52:27,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743884e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:27, skipping insertion in model container [2022-11-02 20:52:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:27" (3/3) ... [2022-11-02 20:52:27,909 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2022-11-02 20:52:27,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:27,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:52:27,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:27,992 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3657fcc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:27,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:52:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 214 states have internal predecessors, (286), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:52:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:52:28,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:28,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:28,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1609888969, now seen corresponding path program 1 times [2022-11-02 20:52:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882360590] [2022-11-02 20:52:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882360590] [2022-11-02 20:52:28,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882360590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:28,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:28,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608747898] [2022-11-02 20:52:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:28,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:28,400 INFO L87 Difference]: Start difference. First operand has 237 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 214 states have internal predecessors, (286), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:28,559 INFO L93 Difference]: Finished difference Result 404 states and 621 transitions. [2022-11-02 20:52:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:28,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:52:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:28,584 INFO L225 Difference]: With dead ends: 404 [2022-11-02 20:52:28,585 INFO L226 Difference]: Without dead ends: 229 [2022-11-02 20:52:28,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:28,599 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 193 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 447 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-02 20:52:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-02 20:52:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 206 states have internal predecessors, (266), 37 states have call successors, (37), 5 states have call predecessors, (37), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-02 20:52:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2022-11-02 20:52:28,699 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 13 [2022-11-02 20:52:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2022-11-02 20:52:28,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2022-11-02 20:52:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:52:28,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:28,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:28,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:28,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash 22809717, now seen corresponding path program 1 times [2022-11-02 20:52:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627639109] [2022-11-02 20:52:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627639109] [2022-11-02 20:52:28,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627639109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:28,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:28,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81469065] [2022-11-02 20:52:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:28,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:28,876 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:29,042 INFO L93 Difference]: Finished difference Result 471 states and 666 transitions. [2022-11-02 20:52:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:52:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:29,046 INFO L225 Difference]: With dead ends: 471 [2022-11-02 20:52:29,046 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 20:52:29,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,048 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 251 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:29,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 583 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 20:52:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 326. [2022-11-02 20:52:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 281 states have (on average 1.3629893238434163) internal successors, (383), 285 states have internal predecessors, (383), 37 states have call successors, (37), 9 states have call predecessors, (37), 7 states have return successors, (40), 32 states have call predecessors, (40), 27 states have call successors, (40) [2022-11-02 20:52:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 460 transitions. [2022-11-02 20:52:29,078 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 460 transitions. Word has length 18 [2022-11-02 20:52:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,079 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 460 transitions. [2022-11-02 20:52:29,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 460 transitions. [2022-11-02 20:52:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:52:29,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:29,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1035240125, now seen corresponding path program 1 times [2022-11-02 20:52:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072394282] [2022-11-02 20:52:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072394282] [2022-11-02 20:52:29,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072394282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:29,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:29,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116579459] [2022-11-02 20:52:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:29,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,195 INFO L87 Difference]: Start difference. First operand 326 states and 460 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:29,242 INFO L93 Difference]: Finished difference Result 715 states and 1005 transitions. [2022-11-02 20:52:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:29,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:52:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:29,246 INFO L225 Difference]: With dead ends: 715 [2022-11-02 20:52:29,246 INFO L226 Difference]: Without dead ends: 512 [2022-11-02 20:52:29,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,249 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 273 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:29,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 479 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-02 20:52:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 485. [2022-11-02 20:52:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 423 states have (on average 1.3617021276595744) internal successors, (576), 424 states have internal predecessors, (576), 47 states have call successors, (47), 17 states have call predecessors, (47), 14 states have return successors, (61), 44 states have call predecessors, (61), 39 states have call successors, (61) [2022-11-02 20:52:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2022-11-02 20:52:29,289 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 19 [2022-11-02 20:52:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,290 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2022-11-02 20:52:29,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2022-11-02 20:52:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:52:29,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:52:29,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1224032819, now seen corresponding path program 1 times [2022-11-02 20:52:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491170850] [2022-11-02 20:52:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:29,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491170850] [2022-11-02 20:52:29,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491170850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:29,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:29,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103478034] [2022-11-02 20:52:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,380 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:29,447 INFO L93 Difference]: Finished difference Result 574 states and 797 transitions. [2022-11-02 20:52:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:52:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:29,457 INFO L225 Difference]: With dead ends: 574 [2022-11-02 20:52:29,457 INFO L226 Difference]: Without dead ends: 556 [2022-11-02 20:52:29,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,468 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:29,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 384 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-02 20:52:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 523. [2022-11-02 20:52:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 455 states have (on average 1.3604395604395605) internal successors, (619), 462 states have internal predecessors, (619), 49 states have call successors, (49), 20 states have call predecessors, (49), 18 states have return successors, (65), 42 states have call predecessors, (65), 42 states have call successors, (65) [2022-11-02 20:52:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 733 transitions. [2022-11-02 20:52:29,531 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 733 transitions. Word has length 22 [2022-11-02 20:52:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,535 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 733 transitions. [2022-11-02 20:52:29,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 733 transitions. [2022-11-02 20:52:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:52:29,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:29,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1110251401, now seen corresponding path program 1 times [2022-11-02 20:52:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484627034] [2022-11-02 20:52:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484627034] [2022-11-02 20:52:29,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484627034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:29,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:29,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046640313] [2022-11-02 20:52:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:29,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,670 INFO L87 Difference]: Start difference. First operand 523 states and 733 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:29,826 INFO L93 Difference]: Finished difference Result 806 states and 1133 transitions. [2022-11-02 20:52:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:52:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:29,831 INFO L225 Difference]: With dead ends: 806 [2022-11-02 20:52:29,831 INFO L226 Difference]: Without dead ends: 803 [2022-11-02 20:52:29,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:29,832 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 120 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:29,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 662 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2022-11-02 20:52:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 614. [2022-11-02 20:52:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 540 states have (on average 1.3685185185185185) internal successors, (739), 550 states have internal predecessors, (739), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 862 transitions. [2022-11-02 20:52:29,884 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 862 transitions. Word has length 27 [2022-11-02 20:52:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,884 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 862 transitions. [2022-11-02 20:52:29,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 862 transitions. [2022-11-02 20:52:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:52:29,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:52:29,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -296160983, now seen corresponding path program 1 times [2022-11-02 20:52:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105000916] [2022-11-02 20:52:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105000916] [2022-11-02 20:52:30,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105000916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:30,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:30,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474207523] [2022-11-02 20:52:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:30,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:30,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:30,018 INFO L87 Difference]: Start difference. First operand 614 states and 862 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:30,368 INFO L93 Difference]: Finished difference Result 1073 states and 1480 transitions. [2022-11-02 20:52:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:52:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:52:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:30,372 INFO L225 Difference]: With dead ends: 1073 [2022-11-02 20:52:30,372 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:52:30,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:30,387 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 513 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:30,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 527 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:52:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 605. [2022-11-02 20:52:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 531 states have (on average 1.3521657250470809) internal successors, (718), 541 states have internal predecessors, (718), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 841 transitions. [2022-11-02 20:52:30,452 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 841 transitions. Word has length 28 [2022-11-02 20:52:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:30,452 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 841 transitions. [2022-11-02 20:52:30,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 841 transitions. [2022-11-02 20:52:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:52:30,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:30,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:30,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:52:30,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash 115155175, now seen corresponding path program 1 times [2022-11-02 20:52:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:30,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387221182] [2022-11-02 20:52:30,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387221182] [2022-11-02 20:52:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387221182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:30,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249005132] [2022-11-02 20:52:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:30,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:30,504 INFO L87 Difference]: Start difference. First operand 605 states and 841 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:30,768 INFO L93 Difference]: Finished difference Result 650 states and 899 transitions. [2022-11-02 20:52:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-02 20:52:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:30,774 INFO L225 Difference]: With dead ends: 650 [2022-11-02 20:52:30,774 INFO L226 Difference]: Without dead ends: 645 [2022-11-02 20:52:30,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:30,776 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 64 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:30,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 735 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-02 20:52:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2022-11-02 20:52:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 561 states have internal predecessors, (745), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 868 transitions. [2022-11-02 20:52:30,846 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 868 transitions. Word has length 29 [2022-11-02 20:52:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:30,848 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 868 transitions. [2022-11-02 20:52:30,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 868 transitions. [2022-11-02 20:52:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:52:30,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:30,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:52:30,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash -272970601, now seen corresponding path program 1 times [2022-11-02 20:52:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:30,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192731424] [2022-11-02 20:52:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:31,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:31,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192731424] [2022-11-02 20:52:31,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192731424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:31,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:31,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118016336] [2022-11-02 20:52:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:31,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:31,035 INFO L87 Difference]: Start difference. First operand 626 states and 868 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:31,346 INFO L93 Difference]: Finished difference Result 651 states and 898 transitions. [2022-11-02 20:52:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-02 20:52:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:31,350 INFO L225 Difference]: With dead ends: 651 [2022-11-02 20:52:31,351 INFO L226 Difference]: Without dead ends: 645 [2022-11-02 20:52:31,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:31,352 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 393 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:31,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 701 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-02 20:52:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2022-11-02 20:52:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3478260869565217) internal successors, (744), 561 states have internal predecessors, (744), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2022-11-02 20:52:31,418 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 30 [2022-11-02 20:52:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:31,418 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2022-11-02 20:52:31,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2022-11-02 20:52:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:52:31,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:31,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:31,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:52:31,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash -853978920, now seen corresponding path program 1 times [2022-11-02 20:52:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:31,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871777880] [2022-11-02 20:52:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:31,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871777880] [2022-11-02 20:52:31,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871777880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:31,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:31,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146069328] [2022-11-02 20:52:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:31,497 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:31,641 INFO L93 Difference]: Finished difference Result 641 states and 887 transitions. [2022-11-02 20:52:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:31,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:52:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:31,646 INFO L225 Difference]: With dead ends: 641 [2022-11-02 20:52:31,646 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 20:52:31,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:31,649 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 16 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:31,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 547 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 20:52:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 637. [2022-11-02 20:52:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.3463587921847247) internal successors, (758), 571 states have internal predecessors, (758), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 881 transitions. [2022-11-02 20:52:31,739 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 881 transitions. Word has length 30 [2022-11-02 20:52:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:31,740 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 881 transitions. [2022-11-02 20:52:31,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 881 transitions. [2022-11-02 20:52:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:52:31,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:31,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:52:31,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash -732236972, now seen corresponding path program 1 times [2022-11-02 20:52:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:31,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175564107] [2022-11-02 20:52:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:31,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175564107] [2022-11-02 20:52:31,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175564107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:31,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:31,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111289897] [2022-11-02 20:52:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:31,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:31,883 INFO L87 Difference]: Start difference. First operand 637 states and 881 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,223 INFO L93 Difference]: Finished difference Result 662 states and 911 transitions. [2022-11-02 20:52:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-02 20:52:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,227 INFO L225 Difference]: With dead ends: 662 [2022-11-02 20:52:32,228 INFO L226 Difference]: Without dead ends: 656 [2022-11-02 20:52:32,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:32,229 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 374 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 911 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-02 20:52:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 637. [2022-11-02 20:52:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.344582593250444) internal successors, (757), 571 states have internal predecessors, (757), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 20:52:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 880 transitions. [2022-11-02 20:52:32,332 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 880 transitions. Word has length 31 [2022-11-02 20:52:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:32,332 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 880 transitions. [2022-11-02 20:52:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 880 transitions. [2022-11-02 20:52:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:52:32,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:32,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:32,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:52:32,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1140425248, now seen corresponding path program 1 times [2022-11-02 20:52:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:32,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504936890] [2022-11-02 20:52:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:32,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504936890] [2022-11-02 20:52:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504936890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835228706] [2022-11-02 20:52:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:32,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:32,393 INFO L87 Difference]: Start difference. First operand 637 states and 880 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,597 INFO L93 Difference]: Finished difference Result 668 states and 917 transitions. [2022-11-02 20:52:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:32,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-02 20:52:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,602 INFO L225 Difference]: With dead ends: 668 [2022-11-02 20:52:32,602 INFO L226 Difference]: Without dead ends: 652 [2022-11-02 20:52:32,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:32,604 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 52 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1069 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-02 20:52:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 635. [2022-11-02 20:52:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 562 states have (on average 1.3434163701067616) internal successors, (755), 570 states have internal predecessors, (755), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2022-11-02 20:52:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2022-11-02 20:52:32,693 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 32 [2022-11-02 20:52:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:32,693 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2022-11-02 20:52:32,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2022-11-02 20:52:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:52:32,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:32,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:52:32,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1561555971, now seen corresponding path program 1 times [2022-11-02 20:52:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:32,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903702318] [2022-11-02 20:52:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903702318] [2022-11-02 20:52:32,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903702318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:32,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:32,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602906469] [2022-11-02 20:52:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:32,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:32,745 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,855 INFO L93 Difference]: Finished difference Result 1042 states and 1433 transitions. [2022-11-02 20:52:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:52:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,860 INFO L225 Difference]: With dead ends: 1042 [2022-11-02 20:52:32,860 INFO L226 Difference]: Without dead ends: 643 [2022-11-02 20:52:32,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:32,863 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 5 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 558 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-02 20:52:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2022-11-02 20:52:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 570 states have (on average 1.343859649122807) internal successors, (766), 578 states have internal predecessors, (766), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2022-11-02 20:52:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2022-11-02 20:52:32,926 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 34 [2022-11-02 20:52:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:32,926 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2022-11-02 20:52:32,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2022-11-02 20:52:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:52:32,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:32,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:32,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:52:32,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 821298349, now seen corresponding path program 1 times [2022-11-02 20:52:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148850948] [2022-11-02 20:52:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:33,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148850948] [2022-11-02 20:52:33,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148850948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:33,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:33,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462152576] [2022-11-02 20:52:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:33,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:33,011 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:33,334 INFO L93 Difference]: Finished difference Result 727 states and 971 transitions. [2022-11-02 20:52:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:52:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:33,337 INFO L225 Difference]: With dead ends: 727 [2022-11-02 20:52:33,337 INFO L226 Difference]: Without dead ends: 468 [2022-11-02 20:52:33,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:33,342 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 382 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:33,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 824 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-02 20:52:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 427. [2022-11-02 20:52:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 375 states have (on average 1.312) internal successors, (492), 383 states have internal predecessors, (492), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 20:52:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 566 transitions. [2022-11-02 20:52:33,392 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 566 transitions. Word has length 38 [2022-11-02 20:52:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:33,393 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 566 transitions. [2022-11-02 20:52:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 566 transitions. [2022-11-02 20:52:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:52:33,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:33,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:33,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:52:33,396 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1999113680, now seen corresponding path program 1 times [2022-11-02 20:52:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:33,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013406592] [2022-11-02 20:52:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013406592] [2022-11-02 20:52:33,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013406592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:33,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:33,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549945411] [2022-11-02 20:52:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:33,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:33,633 INFO L87 Difference]: Start difference. First operand 427 states and 566 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:33,953 INFO L93 Difference]: Finished difference Result 630 states and 837 transitions. [2022-11-02 20:52:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:52:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:33,956 INFO L225 Difference]: With dead ends: 630 [2022-11-02 20:52:33,956 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 20:52:33,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:33,958 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 74 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:33,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1575 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 20:52:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2022-11-02 20:52:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.3008356545961002) internal successors, (467), 366 states have internal predecessors, (467), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 20:52:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 540 transitions. [2022-11-02 20:52:34,025 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 540 transitions. Word has length 41 [2022-11-02 20:52:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:34,026 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 540 transitions. [2022-11-02 20:52:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-11-02 20:52:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:52:34,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:34,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:52:34,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1097053987, now seen corresponding path program 1 times [2022-11-02 20:52:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048305543] [2022-11-02 20:52:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:34,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048305543] [2022-11-02 20:52:34,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048305543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:34,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:34,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528834274] [2022-11-02 20:52:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:34,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:34,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:34,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:34,122 INFO L87 Difference]: Start difference. First operand 410 states and 540 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:34,555 INFO L93 Difference]: Finished difference Result 505 states and 658 transitions. [2022-11-02 20:52:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:52:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:52:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:34,558 INFO L225 Difference]: With dead ends: 505 [2022-11-02 20:52:34,558 INFO L226 Difference]: Without dead ends: 447 [2022-11-02 20:52:34,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:52:34,559 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 357 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:34,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1128 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-02 20:52:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 410. [2022-11-02 20:52:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.2952646239554317) internal successors, (465), 366 states have internal predecessors, (465), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 20:52:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 538 transitions. [2022-11-02 20:52:34,634 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 538 transitions. Word has length 40 [2022-11-02 20:52:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:34,634 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 538 transitions. [2022-11-02 20:52:34,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 538 transitions. [2022-11-02 20:52:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:52:34,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:34,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:52:34,637 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 418295830, now seen corresponding path program 1 times [2022-11-02 20:52:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:34,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941413589] [2022-11-02 20:52:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:34,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941413589] [2022-11-02 20:52:34,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941413589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:34,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:34,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669877121] [2022-11-02 20:52:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:34,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:34,704 INFO L87 Difference]: Start difference. First operand 410 states and 538 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:34,910 INFO L93 Difference]: Finished difference Result 439 states and 569 transitions. [2022-11-02 20:52:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:52:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:34,913 INFO L225 Difference]: With dead ends: 439 [2022-11-02 20:52:34,913 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 20:52:34,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:34,915 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 74 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:34,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1314 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 20:52:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2022-11-02 20:52:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.2927536231884058) internal successors, (446), 351 states have internal predecessors, (446), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2022-11-02 20:52:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 515 transitions. [2022-11-02 20:52:34,959 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 515 transitions. Word has length 41 [2022-11-02 20:52:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:34,959 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 515 transitions. [2022-11-02 20:52:34,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 515 transitions. [2022-11-02 20:52:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:52:34,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:34,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:34,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:52:34,962 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash -958406699, now seen corresponding path program 1 times [2022-11-02 20:52:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87903376] [2022-11-02 20:52:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:35,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87903376] [2022-11-02 20:52:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87903376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:35,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:35,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283957022] [2022-11-02 20:52:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:35,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:35,096 INFO L87 Difference]: Start difference. First operand 392 states and 515 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:35,480 INFO L93 Difference]: Finished difference Result 595 states and 783 transitions. [2022-11-02 20:52:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:35,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 20:52:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:35,482 INFO L225 Difference]: With dead ends: 595 [2022-11-02 20:52:35,482 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 20:52:35,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:35,484 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 315 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:35,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 899 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 20:52:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2022-11-02 20:52:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.289855072463768) internal successors, (445), 351 states have internal predecessors, (445), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2022-11-02 20:52:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 514 transitions. [2022-11-02 20:52:35,546 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 514 transitions. Word has length 43 [2022-11-02 20:52:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:35,546 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 514 transitions. [2022-11-02 20:52:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 514 transitions. [2022-11-02 20:52:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:52:35,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:35,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:52:35,549 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -328240312, now seen corresponding path program 1 times [2022-11-02 20:52:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060524191] [2022-11-02 20:52:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:35,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060524191] [2022-11-02 20:52:35,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060524191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:35,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:35,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197495528] [2022-11-02 20:52:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:35,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:35,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:35,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:35,662 INFO L87 Difference]: Start difference. First operand 392 states and 514 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:35,995 INFO L93 Difference]: Finished difference Result 665 states and 879 transitions. [2022-11-02 20:52:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-02 20:52:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:35,998 INFO L225 Difference]: With dead ends: 665 [2022-11-02 20:52:35,999 INFO L226 Difference]: Without dead ends: 411 [2022-11-02 20:52:36,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:36,002 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 334 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:36,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 902 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-02 20:52:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 384. [2022-11-02 20:52:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 344 states have internal predecessors, (433), 32 states have call successors, (32), 14 states have call predecessors, (32), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2022-11-02 20:52:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 501 transitions. [2022-11-02 20:52:36,069 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 501 transitions. Word has length 42 [2022-11-02 20:52:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:36,069 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 501 transitions. [2022-11-02 20:52:36,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2022-11-02 20:52:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:52:36,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:36,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:36,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:52:36,072 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:36,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -942033848, now seen corresponding path program 1 times [2022-11-02 20:52:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:36,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136731907] [2022-11-02 20:52:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:36,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136731907] [2022-11-02 20:52:36,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136731907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:36,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:36,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326347080] [2022-11-02 20:52:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:36,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:36,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:36,122 INFO L87 Difference]: Start difference. First operand 384 states and 501 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:36,314 INFO L93 Difference]: Finished difference Result 410 states and 528 transitions. [2022-11-02 20:52:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-02 20:52:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:36,317 INFO L225 Difference]: With dead ends: 410 [2022-11-02 20:52:36,317 INFO L226 Difference]: Without dead ends: 397 [2022-11-02 20:52:36,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:36,318 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 80 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:36,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 687 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-02 20:52:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2022-11-02 20:52:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 336 states have (on average 1.2738095238095237) internal successors, (428), 341 states have internal predecessors, (428), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2022-11-02 20:52:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 495 transitions. [2022-11-02 20:52:36,370 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 495 transitions. Word has length 42 [2022-11-02 20:52:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:36,371 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 495 transitions. [2022-11-02 20:52:36,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 495 transitions. [2022-11-02 20:52:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:52:36,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:36,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:36,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:52:36,374 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1313908054, now seen corresponding path program 1 times [2022-11-02 20:52:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:36,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527851672] [2022-11-02 20:52:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527851672] [2022-11-02 20:52:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527851672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:52:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954778352] [2022-11-02 20:52:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:36,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:36,510 INFO L87 Difference]: Start difference. First operand 381 states and 495 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:36,905 INFO L93 Difference]: Finished difference Result 426 states and 550 transitions. [2022-11-02 20:52:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 20:52:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:36,908 INFO L225 Difference]: With dead ends: 426 [2022-11-02 20:52:36,909 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 20:52:36,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:36,910 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 227 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:36,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1530 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 20:52:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 396. [2022-11-02 20:52:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.262857142857143) internal successors, (442), 355 states have internal predecessors, (442), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (42), 27 states have call predecessors, (42), 26 states have call successors, (42) [2022-11-02 20:52:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 515 transitions. [2022-11-02 20:52:36,984 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 515 transitions. Word has length 43 [2022-11-02 20:52:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:36,984 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 515 transitions. [2022-11-02 20:52:36,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 515 transitions. [2022-11-02 20:52:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:52:36,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:36,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:52:36,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1314184884, now seen corresponding path program 1 times [2022-11-02 20:52:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604012914] [2022-11-02 20:52:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:37,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604012914] [2022-11-02 20:52:37,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604012914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:37,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:37,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:52:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896533037] [2022-11-02 20:52:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:37,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:37,109 INFO L87 Difference]: Start difference. First operand 396 states and 515 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:37,469 INFO L93 Difference]: Finished difference Result 422 states and 543 transitions. [2022-11-02 20:52:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 20:52:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:37,473 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:52:37,473 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 20:52:37,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:37,474 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 49 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:37,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1649 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 20:52:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 393. [2022-11-02 20:52:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 347 states have (on average 1.2651296829971181) internal successors, (439), 353 states have internal predecessors, (439), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (41), 26 states have call predecessors, (41), 26 states have call successors, (41) [2022-11-02 20:52:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 511 transitions. [2022-11-02 20:52:37,523 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 511 transitions. Word has length 43 [2022-11-02 20:52:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:37,524 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 511 transitions. [2022-11-02 20:52:37,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2022-11-02 20:52:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:52:37,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:37,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:37,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:52:37,526 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2100455983, now seen corresponding path program 1 times [2022-11-02 20:52:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:37,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061525244] [2022-11-02 20:52:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:52:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:37,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061525244] [2022-11-02 20:52:37,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061525244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:37,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:37,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64703369] [2022-11-02 20:52:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:37,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:37,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:37,629 INFO L87 Difference]: Start difference. First operand 393 states and 511 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:37,996 INFO L93 Difference]: Finished difference Result 413 states and 531 transitions. [2022-11-02 20:52:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:37,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:52:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:38,000 INFO L225 Difference]: With dead ends: 413 [2022-11-02 20:52:38,000 INFO L226 Difference]: Without dead ends: 397 [2022-11-02 20:52:38,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:38,001 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 384 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:38,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 837 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-02 20:52:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 377. [2022-11-02 20:52:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.2702702702702702) internal successors, (423), 338 states have internal predecessors, (423), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2022-11-02 20:52:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2022-11-02 20:52:38,051 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 44 [2022-11-02 20:52:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:38,051 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2022-11-02 20:52:38,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2022-11-02 20:52:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:52:38,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:38,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:38,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:52:38,053 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -258023597, now seen corresponding path program 1 times [2022-11-02 20:52:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:38,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458876806] [2022-11-02 20:52:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458876806] [2022-11-02 20:52:38,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458876806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:38,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:38,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100312707] [2022-11-02 20:52:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:38,129 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:38,355 INFO L93 Difference]: Finished difference Result 656 states and 846 transitions. [2022-11-02 20:52:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:52:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:38,358 INFO L225 Difference]: With dead ends: 656 [2022-11-02 20:52:38,359 INFO L226 Difference]: Without dead ends: 468 [2022-11-02 20:52:38,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:38,360 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 160 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:38,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 747 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-02 20:52:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 430. [2022-11-02 20:52:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2703412073490814) internal successors, (484), 385 states have internal predecessors, (484), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2022-11-02 20:52:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 557 transitions. [2022-11-02 20:52:38,428 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 557 transitions. Word has length 46 [2022-11-02 20:52:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:38,429 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 557 transitions. [2022-11-02 20:52:38,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 557 transitions. [2022-11-02 20:52:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:52:38,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:38,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:38,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:52:38,431 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash 796550874, now seen corresponding path program 1 times [2022-11-02 20:52:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28986531] [2022-11-02 20:52:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:38,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28986531] [2022-11-02 20:52:38,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28986531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:38,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:38,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7870554] [2022-11-02 20:52:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:38,602 INFO L87 Difference]: Start difference. First operand 430 states and 557 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:38,880 INFO L93 Difference]: Finished difference Result 692 states and 895 transitions. [2022-11-02 20:52:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:38,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:52:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:38,883 INFO L225 Difference]: With dead ends: 692 [2022-11-02 20:52:38,883 INFO L226 Difference]: Without dead ends: 471 [2022-11-02 20:52:38,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:38,885 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 52 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:38,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1610 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-02 20:52:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 430. [2022-11-02 20:52:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2650918635170603) internal successors, (482), 385 states have internal predecessors, (482), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2022-11-02 20:52:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 555 transitions. [2022-11-02 20:52:38,949 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 555 transitions. Word has length 48 [2022-11-02 20:52:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:38,949 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 555 transitions. [2022-11-02 20:52:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 555 transitions. [2022-11-02 20:52:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:52:38,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:38,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:38,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:52:38,954 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 364501516, now seen corresponding path program 1 times [2022-11-02 20:52:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441114356] [2022-11-02 20:52:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:52:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:39,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:39,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441114356] [2022-11-02 20:52:39,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441114356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:39,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:39,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019168] [2022-11-02 20:52:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:39,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:39,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:39,088 INFO L87 Difference]: Start difference. First operand 430 states and 555 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:39,456 INFO L93 Difference]: Finished difference Result 457 states and 584 transitions. [2022-11-02 20:52:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:52:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:39,459 INFO L225 Difference]: With dead ends: 457 [2022-11-02 20:52:39,460 INFO L226 Difference]: Without dead ends: 438 [2022-11-02 20:52:39,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:39,461 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 53 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:39,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1844 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-02 20:52:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 426. [2022-11-02 20:52:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 378 states have (on average 1.2645502645502646) internal successors, (478), 382 states have internal predecessors, (478), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (40), 28 states have call predecessors, (40), 27 states have call successors, (40) [2022-11-02 20:52:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 549 transitions. [2022-11-02 20:52:39,542 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 549 transitions. Word has length 48 [2022-11-02 20:52:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:39,543 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 549 transitions. [2022-11-02 20:52:39,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 549 transitions. [2022-11-02 20:52:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:52:39,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:39,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:39,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:52:39,549 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -271028192, now seen corresponding path program 1 times [2022-11-02 20:52:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773636736] [2022-11-02 20:52:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:39,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773636736] [2022-11-02 20:52:39,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773636736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:39,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:39,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291869397] [2022-11-02 20:52:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:39,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:39,662 INFO L87 Difference]: Start difference. First operand 426 states and 549 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:39,997 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2022-11-02 20:52:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:39,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-11-02 20:52:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:39,999 INFO L225 Difference]: With dead ends: 453 [2022-11-02 20:52:40,000 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 20:52:40,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:40,001 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 53 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:40,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1870 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 20:52:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 421. [2022-11-02 20:52:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 374 states have (on average 1.2647058823529411) internal successors, (473), 378 states have internal predecessors, (473), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (39), 27 states have call predecessors, (39), 26 states have call successors, (39) [2022-11-02 20:52:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 542 transitions. [2022-11-02 20:52:40,056 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 542 transitions. Word has length 49 [2022-11-02 20:52:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:40,056 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 542 transitions. [2022-11-02 20:52:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 542 transitions. [2022-11-02 20:52:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:52:40,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:40,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:40,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:52:40,058 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash -990020389, now seen corresponding path program 1 times [2022-11-02 20:52:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:40,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679783888] [2022-11-02 20:52:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679783888] [2022-11-02 20:52:40,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679783888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:40,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:40,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807906016] [2022-11-02 20:52:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:40,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:40,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:40,157 INFO L87 Difference]: Start difference. First operand 421 states and 542 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:40,527 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2022-11-02 20:52:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-11-02 20:52:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:40,530 INFO L225 Difference]: With dead ends: 448 [2022-11-02 20:52:40,530 INFO L226 Difference]: Without dead ends: 429 [2022-11-02 20:52:40,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:40,531 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 53 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:40,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1760 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-02 20:52:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2022-11-02 20:52:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 375 states have internal predecessors, (469), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2022-11-02 20:52:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 536 transitions. [2022-11-02 20:52:40,608 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 536 transitions. Word has length 49 [2022-11-02 20:52:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:40,608 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 536 transitions. [2022-11-02 20:52:40,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 536 transitions. [2022-11-02 20:52:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:52:40,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:40,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:40,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:52:40,610 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2105334868, now seen corresponding path program 1 times [2022-11-02 20:52:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:40,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949517269] [2022-11-02 20:52:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:40,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949517269] [2022-11-02 20:52:40,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949517269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:40,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:40,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114506505] [2022-11-02 20:52:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:40,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:40,777 INFO L87 Difference]: Start difference. First operand 417 states and 536 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:41,084 INFO L93 Difference]: Finished difference Result 771 states and 1003 transitions. [2022-11-02 20:52:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:41,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 20:52:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:41,087 INFO L225 Difference]: With dead ends: 771 [2022-11-02 20:52:41,088 INFO L226 Difference]: Without dead ends: 561 [2022-11-02 20:52:41,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:41,089 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 104 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:41,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1794 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-02 20:52:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 417. [2022-11-02 20:52:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.261455525606469) internal successors, (468), 375 states have internal predecessors, (468), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2022-11-02 20:52:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2022-11-02 20:52:41,148 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 51 [2022-11-02 20:52:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:41,148 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2022-11-02 20:52:41,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-11-02 20:52:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:52:41,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:41,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:41,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:52:41,150 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1346983850, now seen corresponding path program 1 times [2022-11-02 20:52:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:41,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229240787] [2022-11-02 20:52:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:41,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229240787] [2022-11-02 20:52:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229240787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:41,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:41,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61439454] [2022-11-02 20:52:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:41,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:41,286 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:41,629 INFO L93 Difference]: Finished difference Result 444 states and 564 transitions. [2022-11-02 20:52:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:41,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-11-02 20:52:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:41,632 INFO L225 Difference]: With dead ends: 444 [2022-11-02 20:52:41,632 INFO L226 Difference]: Without dead ends: 407 [2022-11-02 20:52:41,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:41,634 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 61 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:41,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1764 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-02 20:52:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 395. [2022-11-02 20:52:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 352 states have (on average 1.2613636363636365) internal successors, (444), 356 states have internal predecessors, (444), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-02 20:52:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 507 transitions. [2022-11-02 20:52:41,693 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 507 transitions. Word has length 53 [2022-11-02 20:52:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:41,693 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 507 transitions. [2022-11-02 20:52:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:52:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 507 transitions. [2022-11-02 20:52:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:52:41,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:41,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:41,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:52:41,696 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash 561946474, now seen corresponding path program 1 times [2022-11-02 20:52:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:41,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031045664] [2022-11-02 20:52:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031045664] [2022-11-02 20:52:41,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031045664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:41,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:41,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021889379] [2022-11-02 20:52:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:41,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:41,808 INFO L87 Difference]: Start difference. First operand 395 states and 507 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:42,116 INFO L93 Difference]: Finished difference Result 613 states and 781 transitions. [2022-11-02 20:52:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:42,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-11-02 20:52:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:42,119 INFO L225 Difference]: With dead ends: 613 [2022-11-02 20:52:42,119 INFO L226 Difference]: Without dead ends: 382 [2022-11-02 20:52:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:42,120 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 132 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:42,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1169 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-02 20:52:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 362. [2022-11-02 20:52:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 324 states have (on average 1.2623456790123457) internal successors, (409), 327 states have internal predecessors, (409), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2022-11-02 20:52:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 457 transitions. [2022-11-02 20:52:42,173 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 457 transitions. Word has length 59 [2022-11-02 20:52:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:42,173 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 457 transitions. [2022-11-02 20:52:42,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 457 transitions. [2022-11-02 20:52:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:52:42,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:42,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:52:42,176 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -597775662, now seen corresponding path program 1 times [2022-11-02 20:52:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:42,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980398742] [2022-11-02 20:52:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:42,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:52:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980398742] [2022-11-02 20:52:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980398742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139445495] [2022-11-02 20:52:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:42,315 INFO L87 Difference]: Start difference. First operand 362 states and 457 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:42,867 INFO L93 Difference]: Finished difference Result 760 states and 936 transitions. [2022-11-02 20:52:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:52:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-11-02 20:52:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:42,870 INFO L225 Difference]: With dead ends: 760 [2022-11-02 20:52:42,870 INFO L226 Difference]: Without dead ends: 487 [2022-11-02 20:52:42,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:52:42,872 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 387 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:42,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1181 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:52:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-02 20:52:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 456. [2022-11-02 20:52:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 408 states have (on average 1.2475490196078431) internal successors, (509), 413 states have internal predecessors, (509), 26 states have call successors, (26), 20 states have call predecessors, (26), 21 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-02 20:52:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 562 transitions. [2022-11-02 20:52:42,943 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 562 transitions. Word has length 61 [2022-11-02 20:52:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:42,943 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 562 transitions. [2022-11-02 20:52:42,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 562 transitions. [2022-11-02 20:52:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:52:42,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:42,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:42,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:52:42,945 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2002443203, now seen corresponding path program 1 times [2022-11-02 20:52:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:42,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424772695] [2022-11-02 20:52:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:52:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:43,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424772695] [2022-11-02 20:52:43,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424772695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:43,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059882689] [2022-11-02 20:52:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:43,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:43,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:43,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:43,090 INFO L87 Difference]: Start difference. First operand 456 states and 562 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:52:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:43,504 INFO L93 Difference]: Finished difference Result 458 states and 563 transitions. [2022-11-02 20:52:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2022-11-02 20:52:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:43,507 INFO L225 Difference]: With dead ends: 458 [2022-11-02 20:52:43,507 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 20:52:43,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:43,508 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 97 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:43,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1606 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 20:52:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-11-02 20:52:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.2532894736842106) internal successors, (381), 308 states have internal predecessors, (381), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:52:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2022-11-02 20:52:43,566 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 62 [2022-11-02 20:52:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:43,567 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2022-11-02 20:52:43,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:52:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2022-11-02 20:52:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:52:43,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:43,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:43,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:52:43,569 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1297666020, now seen corresponding path program 1 times [2022-11-02 20:52:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:43,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479285172] [2022-11-02 20:52:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479285172] [2022-11-02 20:52:43,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479285172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:43,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:43,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626299163] [2022-11-02 20:52:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:43,738 INFO L87 Difference]: Start difference. First operand 343 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,066 INFO L93 Difference]: Finished difference Result 378 states and 464 transitions. [2022-11-02 20:52:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2022-11-02 20:52:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:44,068 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:52:44,069 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 20:52:44,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:44,070 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 225 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:44,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1109 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 20:52:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351. [2022-11-02 20:52:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 311 states have (on average 1.247588424437299) internal successors, (388), 315 states have internal predecessors, (388), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 19 states have call successors, (25) [2022-11-02 20:52:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 434 transitions. [2022-11-02 20:52:44,123 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 434 transitions. Word has length 63 [2022-11-02 20:52:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:44,123 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 434 transitions. [2022-11-02 20:52:44,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 434 transitions. [2022-11-02 20:52:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:52:44,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:44,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:44,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:52:44,126 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1652262591, now seen corresponding path program 1 times [2022-11-02 20:52:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237702069] [2022-11-02 20:52:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:52:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237702069] [2022-11-02 20:52:44,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237702069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688249510] [2022-11-02 20:52:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:44,269 INFO L87 Difference]: Start difference. First operand 351 states and 434 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,558 INFO L93 Difference]: Finished difference Result 378 states and 463 transitions. [2022-11-02 20:52:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2022-11-02 20:52:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:44,560 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:52:44,560 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 20:52:44,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:52:44,561 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 50 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:44,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1386 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 20:52:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 343. [2022-11-02 20:52:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.25) internal successors, (380), 308 states have internal predecessors, (380), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:52:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2022-11-02 20:52:44,613 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 64 [2022-11-02 20:52:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:44,613 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2022-11-02 20:52:44,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2022-11-02 20:52:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:52:44,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:44,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:52:44,615 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1123895006, now seen corresponding path program 1 times [2022-11-02 20:52:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739925771] [2022-11-02 20:52:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739925771] [2022-11-02 20:52:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739925771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830378518] [2022-11-02 20:52:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:44,753 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,024 INFO L93 Difference]: Finished difference Result 501 states and 617 transitions. [2022-11-02 20:52:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-02 20:52:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:45,028 INFO L225 Difference]: With dead ends: 501 [2022-11-02 20:52:45,029 INFO L226 Difference]: Without dead ends: 370 [2022-11-02 20:52:45,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:52:45,033 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 106 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:45,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1016 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-02 20:52:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 354. [2022-11-02 20:52:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 314 states have (on average 1.2261146496815287) internal successors, (385), 319 states have internal predecessors, (385), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:52:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 430 transitions. [2022-11-02 20:52:45,100 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 430 transitions. Word has length 68 [2022-11-02 20:52:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:45,100 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 430 transitions. [2022-11-02 20:52:45,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 430 transitions. [2022-11-02 20:52:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:52:45,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:45,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:45,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:52:45,104 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1269620070, now seen corresponding path program 1 times [2022-11-02 20:52:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792778258] [2022-11-02 20:52:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:52:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792778258] [2022-11-02 20:52:45,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792778258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869354149] [2022-11-02 20:52:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:45,255 INFO L87 Difference]: Start difference. First operand 354 states and 430 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:52:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,485 INFO L93 Difference]: Finished difference Result 453 states and 553 transitions. [2022-11-02 20:52:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:45,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2022-11-02 20:52:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:45,487 INFO L225 Difference]: With dead ends: 453 [2022-11-02 20:52:45,488 INFO L226 Difference]: Without dead ends: 389 [2022-11-02 20:52:45,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:45,489 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 77 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:45,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1148 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-02 20:52:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 262. [2022-11-02 20:52:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.1818181818181819) internal successors, (273), 235 states have internal predecessors, (273), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-02 20:52:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-02 20:52:45,536 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 71 [2022-11-02 20:52:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:45,536 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-02 20:52:45,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:52:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-02 20:52:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:52:45,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:45,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:45,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:52:45,539 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1011268274, now seen corresponding path program 1 times [2022-11-02 20:52:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780514929] [2022-11-02 20:52:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:52:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:52:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780514929] [2022-11-02 20:52:45,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780514929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59181881] [2022-11-02 20:52:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:45,699 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,935 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2022-11-02 20:52:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-11-02 20:52:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:45,936 INFO L225 Difference]: With dead ends: 293 [2022-11-02 20:52:45,937 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 20:52:45,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:45,938 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 46 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:45,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1043 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 20:52:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 208. [2022-11-02 20:52:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.1630434782608696) internal successors, (214), 187 states have internal predecessors, (214), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-02 20:52:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-11-02 20:52:45,973 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 74 [2022-11-02 20:52:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:45,974 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-11-02 20:52:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-11-02 20:52:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:52:45,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:45,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:45,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:52:45,976 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1133406279, now seen corresponding path program 1 times [2022-11-02 20:52:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103741259] [2022-11-02 20:52:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:52:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:52:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:46,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:46,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103741259] [2022-11-02 20:52:46,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103741259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:46,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:46,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343629062] [2022-11-02 20:52:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:46,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:46,112 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:46,618 INFO L93 Difference]: Finished difference Result 402 states and 463 transitions. [2022-11-02 20:52:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:52:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-11-02 20:52:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:46,621 INFO L225 Difference]: With dead ends: 402 [2022-11-02 20:52:46,621 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 20:52:46,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:46,622 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 370 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:46,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1362 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 20:52:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 188. [2022-11-02 20:52:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 170 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:52:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2022-11-02 20:52:46,673 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 74 [2022-11-02 20:52:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:46,674 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2022-11-02 20:52:46,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2022-11-02 20:52:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:52:46,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:46,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:52:46,676 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:46,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2004746452, now seen corresponding path program 1 times [2022-11-02 20:52:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230149514] [2022-11-02 20:52:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:52:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230149514] [2022-11-02 20:52:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230149514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:46,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:46,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171118497] [2022-11-02 20:52:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:46,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:46,784 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:46,927 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2022-11-02 20:52:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2022-11-02 20:52:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:46,929 INFO L225 Difference]: With dead ends: 253 [2022-11-02 20:52:46,929 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:52:46,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:46,930 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 45 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:46,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 473 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:52:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2022-11-02 20:52:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1547619047619047) internal successors, (194), 170 states have internal predecessors, (194), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:52:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-11-02 20:52:46,964 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 80 [2022-11-02 20:52:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:46,965 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-11-02 20:52:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:52:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-11-02 20:52:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:52:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:46,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:46,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:52:46,967 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1995188002, now seen corresponding path program 1 times [2022-11-02 20:52:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300846576] [2022-11-02 20:52:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:52:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:52:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300846576] [2022-11-02 20:52:47,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300846576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:47,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:47,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143445201] [2022-11-02 20:52:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:47,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:47,079 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,224 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2022-11-02 20:52:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2022-11-02 20:52:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,226 INFO L225 Difference]: With dead ends: 244 [2022-11-02 20:52:47,226 INFO L226 Difference]: Without dead ends: 218 [2022-11-02 20:52:47,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:47,227 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 538 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-02 20:52:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2022-11-02 20:52:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 172 states have internal predecessors, (196), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:52:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2022-11-02 20:52:47,265 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 100 [2022-11-02 20:52:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:47,265 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2022-11-02 20:52:47,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2022-11-02 20:52:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:52:47,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:47,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:52:47,267 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1423048990, now seen corresponding path program 1 times [2022-11-02 20:52:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785976660] [2022-11-02 20:52:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:52:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:52:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785976660] [2022-11-02 20:52:47,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785976660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:47,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:47,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29784416] [2022-11-02 20:52:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:47,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:47,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:47,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:47,456 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,753 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2022-11-02 20:52:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:47,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2022-11-02 20:52:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,755 INFO L225 Difference]: With dead ends: 230 [2022-11-02 20:52:47,755 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:52:47,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:52:47,756 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 300 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 762 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:52:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2022-11-02 20:52:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1428571428571428) internal successors, (192), 170 states have internal predecessors, (192), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:52:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2022-11-02 20:52:47,794 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 100 [2022-11-02 20:52:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:47,794 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2022-11-02 20:52:47,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2022-11-02 20:52:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:52:47,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:47,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:52:47,797 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1958156221, now seen corresponding path program 1 times [2022-11-02 20:52:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028631197] [2022-11-02 20:52:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:52:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:52:48,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:48,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028631197] [2022-11-02 20:52:48,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028631197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:48,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:48,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:52:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467082226] [2022-11-02 20:52:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:48,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:52:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:52:48,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:48,121 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:48,665 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2022-11-02 20:52:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:52:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 101 [2022-11-02 20:52:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:48,667 INFO L225 Difference]: With dead ends: 296 [2022-11-02 20:52:48,667 INFO L226 Difference]: Without dead ends: 262 [2022-11-02 20:52:48,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:52:48,668 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 464 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:48,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1319 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-02 20:52:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2022-11-02 20:52:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1483516483516483) internal successors, (209), 184 states have internal predecessors, (209), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:52:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 229 transitions. [2022-11-02 20:52:48,709 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 229 transitions. Word has length 101 [2022-11-02 20:52:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:48,709 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 229 transitions. [2022-11-02 20:52:48,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 229 transitions. [2022-11-02 20:52:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 20:52:48,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:48,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:52:48,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:52:48,711 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -795331448, now seen corresponding path program 1 times [2022-11-02 20:52:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:48,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447785686] [2022-11-02 20:52:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:52:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:52:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:49,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447785686] [2022-11-02 20:52:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447785686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:49,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:52:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645213547] [2022-11-02 20:52:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:49,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:52:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:52:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:49,034 INFO L87 Difference]: Start difference. First operand 203 states and 229 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:49,390 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2022-11-02 20:52:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 102 [2022-11-02 20:52:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:49,392 INFO L225 Difference]: With dead ends: 277 [2022-11-02 20:52:49,392 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 20:52:49,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:52:49,402 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 30 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:49,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1568 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 20:52:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2022-11-02 20:52:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1428571428571428) internal successors, (208), 184 states have internal predecessors, (208), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:52:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2022-11-02 20:52:49,443 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 102 [2022-11-02 20:52:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:49,445 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2022-11-02 20:52:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2022-11-02 20:52:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:52:49,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:49,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:49,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:52:49,448 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -994336985, now seen corresponding path program 1 times [2022-11-02 20:52:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138708758] [2022-11-02 20:52:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:52:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:52:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:49,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138708758] [2022-11-02 20:52:49,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138708758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:49,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:49,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983732562] [2022-11-02 20:52:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:49,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:49,591 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:49,740 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2022-11-02 20:52:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2022-11-02 20:52:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:49,743 INFO L225 Difference]: With dead ends: 255 [2022-11-02 20:52:49,743 INFO L226 Difference]: Without dead ends: 195 [2022-11-02 20:52:49,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:49,744 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:49,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 357 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-02 20:52:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2022-11-02 20:52:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:52:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2022-11-02 20:52:49,793 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 105 [2022-11-02 20:52:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:49,793 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2022-11-02 20:52:49,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:52:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2022-11-02 20:52:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:52:49,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:49,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:49,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:52:49,796 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1779359193, now seen corresponding path program 1 times [2022-11-02 20:52:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:49,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000119023] [2022-11-02 20:52:49,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:52:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:52:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:52:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000119023] [2022-11-02 20:52:50,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000119023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:50,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:50,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032060815] [2022-11-02 20:52:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:50,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:50,028 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:50,226 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2022-11-02 20:52:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 111 [2022-11-02 20:52:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:50,227 INFO L225 Difference]: With dead ends: 235 [2022-11-02 20:52:50,227 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 20:52:50,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:50,228 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:50,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 767 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 20:52:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 20:52:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1118881118881119) internal successors, (159), 144 states have internal predecessors, (159), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:52:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2022-11-02 20:52:50,267 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 111 [2022-11-02 20:52:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2022-11-02 20:52:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2022-11-02 20:52:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:52:50,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:50,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:50,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:52:50,270 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1895619621, now seen corresponding path program 1 times [2022-11-02 20:52:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659386487] [2022-11-02 20:52:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:52:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:52:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:52:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:50,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659386487] [2022-11-02 20:52:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659386487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:50,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880724928] [2022-11-02 20:52:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:50,454 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:50,773 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2022-11-02 20:52:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:52:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2022-11-02 20:52:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:50,774 INFO L225 Difference]: With dead ends: 328 [2022-11-02 20:52:50,775 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 20:52:50,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:52:50,776 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:50,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 744 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 20:52:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 20:52:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 144 states have internal predecessors, (158), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:52:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2022-11-02 20:52:50,815 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 112 [2022-11-02 20:52:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:50,816 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2022-11-02 20:52:50,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2022-11-02 20:52:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:52:50,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:50,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:50,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:52:50,818 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -77545757, now seen corresponding path program 1 times [2022-11-02 20:52:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:50,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791753168] [2022-11-02 20:52:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:52:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:52:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:52:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:52:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:52:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:51,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791753168] [2022-11-02 20:52:51,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791753168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:51,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:51,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:52:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149942212] [2022-11-02 20:52:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:51,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:52:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:52:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:52:51,086 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:51,606 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-11-02 20:52:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2022-11-02 20:52:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:51,608 INFO L225 Difference]: With dead ends: 173 [2022-11-02 20:52:51,608 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:52:51,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:52:51,609 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 382 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:51,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 739 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:52:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:52:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:52:51,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-11-02 20:52:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:51,611 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:52:51,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:52:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:52:51,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:52:51,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:52:51,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:52:51,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.